cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 13 results. Next

A003415 a(n) = n' = arithmetic derivative of n: a(0) = a(1) = 0, a(prime) = 1, a(m*n) = m*a(n) + n*a(m).

Original entry on oeis.org

0, 0, 1, 1, 4, 1, 5, 1, 12, 6, 7, 1, 16, 1, 9, 8, 32, 1, 21, 1, 24, 10, 13, 1, 44, 10, 15, 27, 32, 1, 31, 1, 80, 14, 19, 12, 60, 1, 21, 16, 68, 1, 41, 1, 48, 39, 25, 1, 112, 14, 45, 20, 56, 1, 81, 16, 92, 22, 31, 1, 92, 1, 33, 51, 192, 18, 61, 1, 72, 26, 59, 1, 156, 1, 39, 55, 80, 18, 71
Offset: 0

Views

Author

N. J. A. Sloane, R. K. Guy

Keywords

Comments

Can be extended to negative numbers by defining a(-n) = -a(n).
Based on the product rule for differentiation of functions: for functions f(x) and g(x), (fg)' = f'g + fg'. So with numbers, (ab)' = a'b + ab'. This implies 1' = 0. - Kerry Mitchell, Mar 18 2004
The derivative of a number x with respect to a prime number p as being the number "dx/dp" = (x-x^p)/p, which is an integer due to Fermat's little theorem. - Alexandru Buium, Mar 18 2004
The relation (ab)' = a'b + ab' implies 1' = 0, but it does not imply p' = 1 for p a prime. In fact, any function f defined on the primes can be extended uniquely to a function on the integers satisfying this relation: f(Product_i p_i^e_i) = (Product_i p_i^e_i) * (Sum_i e_i*f(p_i)/p_i). - Franklin T. Adams-Watters, Nov 07 2006
See A131116 and A131117 for record values and where they occur. - Reinhard Zumkeller, Jun 17 2007
Let n be the product of a multiset P of k primes. Consider the k-dimensional box whose edges are the elements of P. Then the (k-1)-dimensional surface of this box is 2*a(n). For example, 2*a(25) = 20, the perimeter of a 5 X 5 square. Similarly, 2*a(18) = 42, the surface area of a 2 X 3 X 3 box. - David W. Wilson, Mar 11 2011
The arithmetic derivative n' was introduced, probably for the first time, by the Spanish mathematician José Mingot Shelly in June 1911 with "Una cuestión de la teoría de los números", work presented at the "Tercer Congreso Nacional para el Progreso de las Ciencias, Granada", cf. link to the abstract on Zentralblatt MATH, and L. E. Dickson, History of the Theory of Numbers. - Giorgio Balzarotti, Oct 19 2013
a(A235991(n)) odd; a(A235992(n)) even. - Reinhard Zumkeller, Mar 11 2014
Sequence A157037 lists numbers with prime arithmetic derivative, i.e., indices of primes in this sequence. - M. F. Hasler, Apr 07 2015
Maybe the simplest "natural extension" of the arithmetic derivative, in the spirit of the above remark by Franklin T. Adams-Watters (2006), is the "pi based" version where f(p) = primepi(p), see sequence A258851. When f is chosen to be the identity map (on primes), one gets A066959. - M. F. Hasler, Jul 13 2015
When n is composite, it appears that a(n) has lower bound 2*sqrt(n), with equality when n is the square of a prime, and a(n) has upper bound (n/2)*log_2(n), with equality when n is a power of 2. - Daniel Forgues, Jun 22 2016
If n = p1*p2*p3*... where p1, p2, p3, ... are all the prime factors of n (not necessarily distinct), and h is a real number (we assume h nonnegative and < 1), the arithmetic derivative of n is equivalent to n' = lim_{h->0} ((p1+h)*(p2+h)*(p3+h)*... - (p1*p2*p3*...))/h. It also follows that the arithmetic derivative of a prime is 1. We could assume h = 1/N, where N is an integer; then the limit becomes {N -> oo}. Note that n = 1 is not a prime and plays the role of constant. - Giorgio Balzarotti, May 01 2023

Examples

			6' = (2*3)' = 2'*3 + 2*3' = 1*3 + 2*1 = 5.
Note that, for example, 2' + 3' = 1 + 1 = 2, (2+3)' = 5' = 1. So ' is not linear.
G.f. = x^2 + x^3 + 4*x^4 + x^5 + 5*x^6 + x^7 + 12*x^8 + 6*x^9 + 7*x^10 + ...

References

  • G. Balzarotti, P. P. Lava, La derivata aritmetica, Editore U. Hoepli, Milano, 2013.
  • E. J. Barbeau, Problem, Canad. Math. Congress Notes, 5 (No. 8, April 1973), 6-7.
  • L. E. Dickson, History of the Theory of Numbers, Vol. 1, Chapter XIX, p. 451, Dover Edition, 2005. (Work originally published in 1919.)
  • A. M. Gleason et al., The William Lowell Putnam Mathematical Competition: Problems and Solutions 1938-1964, Math. Assoc. America, 1980, p. 295.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A086134 (least prime factor of n').
Cf. A086131 (greatest prime factor of n').
Cf. A068719 (derivative of 2n).
Cf. A068720 (derivative of n^2).
Cf. A068721 (derivative of n^3).
Cf. A001787 (derivative of 2^n).
Cf. A027471 (derivative of 3^(n-1)).
Cf. A085708 (derivative of 10^n).
Cf. A068327 (derivative of n^n).
Cf. A024451 (derivative of p#).
Cf. A068237 (numerator of derivative of 1/n).
Cf. A068238 (denominator of derivative of 1/n).
Cf. A068328 (derivative of squarefree numbers).
Cf. A068311 (derivative of n!).
Cf. A168386 (derivative of n!!).
Cf. A260619 (derivative of hyperfactorial(n)).
Cf. A260620 (derivative of superfactorial(n)).
Cf. A068312 (derivative of triangular numbers).
Cf. A068329 (derivative of Fibonacci(n)).
Cf. A096371 (derivative of partition number).
Cf. A099301 (derivative of d(n)).
Cf. A099310 (derivative of phi(n)).
Cf. A342925 (derivative of sigma(n)).
Cf. A349905 (derivative of prime shift).
Cf. A327860 (derivative of primorial base exp-function).
Cf. A369252 (derivative of products of three odd primes), A369251 (same sorted).
Cf. A068346 (second derivative of n).
Cf. A099306 (third derivative of n).
Cf. A258644 (fourth derivative of n).
Cf. A258645 (fifth derivative of n).
Cf. A258646 (sixth derivative of n).
Cf. A258647 (seventh derivative of n).
Cf. A258648 (eighth derivative of n).
Cf. A258649 (ninth derivative of n).
Cf. A258650 (tenth derivative of n).
Cf. A185232 (n-th derivative of n).
Cf. A258651 (A(n,k) = k-th arithmetic derivative of n).
Cf. A085731 (gcd(n,n')), A083345 (n'/gcd(n,n')), A057521 (gcd(n, (n')^k) for k>1).
Cf. A342014 (n' mod n), A369049 (n mod n').
Cf. A341998 (A003557(n')), A342001 (n'/A003557(n)).
Cf. A098699 (least x such that x' = n, antiderivative of n).
Cf. A098700 (n such that x' = n has no integer solution).
Cf. A099302 (number of solutions to x' = n).
Cf. A099303 (greatest x such that x' = n).
Cf. A051674 (n such that n' = n).
Cf. A083347 (n such that n' < n).
Cf. A083348 (n such that n' > n).
Cf. A099304 (least k such that (n+k)' = n' + k').
Cf. A099305 (number of solutions to (n+k)' = n' + k').
Cf. A328235 (least k > 0 such that (n+k)' = u * n' for some natural number u).
Cf. A328236 (least m > 1 such that (m*n)' = u * n' for some natural number u).
Cf. A099307 (least k such that the k-th arithmetic derivative of n is zero).
Cf. A099308 (k-th arithmetic derivative of n is zero for some k).
Cf. A099309 (k-th arithmetic derivative of n is nonzero for all k).
Cf. A129150 (n-th derivative of 2^3).
Cf. A129151 (n-th derivative of 3^4).
Cf. A129152 (n-th derivative of 5^6).
Cf. A189481 (x' = n has a unique solution).
Cf. A190121 (partial sums).
Cf. A258057 (first differences).
Cf. A229501 (n divides the n-th partial sum).
Cf. A165560 (parity).
Cf. A235991 (n' is odd), A235992 (n' is even).
Cf. A327863, A327864, A327865 (n' is a multiple of 3, 4, 5).
Cf. A157037 (n' is prime), A192192 (n'' is prime), A328239 (n''' is prime).
Cf. A328393 (n' is squarefree), A328234 (squarefree and > 1).
Cf. A328244 (n'' is squarefree), A328246 (n''' is squarefree).
Cf. A328303 (n' is not squarefree), A328252 (n' is squarefree, but n is not).
Cf. A328248 (least k such that the (k-1)-th derivative of n is squarefree).
Cf. A328251 (k-th arithmetic derivative is never squarefree for any k >= 0).
Cf. A256750 (least k such that the k-th derivative is either 0 or has a factor p^p).
Cf. A327928 (number of distinct primes p such that p^p divides n').
Cf. A342003 (max. exponent k for any prime power p^k that divides n').
Cf. A327929 (n' has at least one divisor of the form p^p).
Cf. A327978 (n' is primorial number > 1).
Cf. A328243 (n' is a partial sum of primorial numbers and larger than one).
Cf. A328310 (maximal prime exponent of n' minus maximal prime exponent of n).
Cf. A328320 (max. prime exponent of n' is less than that of n).
Cf. A328321 (max. prime exponent of n' is >= that of n).
Cf. A328383 (least k such that the k-th derivative of n is either a multiple or a divisor of n, but not both).
Cf. A263111 (the ordinal transform of a).
Cf. A300251, A319684 (Möbius and inverse Möbius transform).
Cf. A305809 (Dirichlet convolution square).
Cf. A349133, A349173, A349394, A349380, A349618, A349619, A349620, A349621 (for miscellaneous Dirichlet convolutions).
Cf. A069359 (similar formula which agrees on squarefree numbers).
Cf. A258851 (the pi-based arithmetic derivative of n).
Cf. A328768, A328769 (primorial-based arithmetic derivatives of n).
Cf. A328845, A328846 (Fibonacci-based arithmetic derivatives of n).
Cf. A302055, A327963, A327965, A328099 (for other variants and modifications).
Cf. A038554 (another sequence using "derivative" in its name, but involving binary expansion of n).
Cf. A322582, A348507 (lower and upper bounds), also A002620.

Programs

  • GAP
    A003415:= Concatenation([0,0],List(List([2..10^3],Factors),
i->Product(i)*Sum(i,j->1/j))); # Muniru A Asiru, Aug 31 2017
(APL, Dyalog dialect) A003415 ← { ⍺←(0 1 2) ⋄ ⍵≤1:⊃⍺ ⋄ 0=(3⊃⍺)|⍵:((⊃⍺+(2⊃⍺)×(⍵÷3⊃⍺)) ((2⊃⍺)×(3⊃⍺)) (3⊃⍺)) ∇ ⍵÷3⊃⍺ ⋄ ((⊃⍺) (2⊃⍺) (1+(3⊃⍺))) ∇ ⍵} ⍝ Antti Karttunen, Feb 18 2024
  • Haskell
    a003415 0 = 0
a003415 n = ad n a000040_list where
  ad 1 _             = 0
  ad n ps'@(p:ps)
     | n < p * p     = 1
     | r > 0         = ad n ps
     | otherwise     = n' + p * ad n' ps' where
       (n',r) = divMod n p
-- Reinhard Zumkeller, May 09 2011
  • Magma
    Ad:=func; [n le 1 select 0 else Ad(n): n in [0..80]]; // Bruno Berselli, Oct 22 2013
  • Maple
    A003415 := proc(n) local B,m,i,t1,t2,t3; B := 1000000000039; if n<=1 then RETURN(0); fi; if isprime(n) then RETURN(1); fi; t1 := ifactor(B*n); m := nops(t1); t2 := 0; for i from 1 to m do t3 := op(i,t1); if nops(t3) = 1 then t2 := t2+1/op(t3); else t2 := t2+op(2,t3)/op(op(1,t3)); fi od: t2 := t2-1/B; n*t2; end;
A003415 := proc(n)
        local a,f;
        a := 0 ;
        for f in ifactors(n)[2] do
                a := a+ op(2,f)/op(1,f);
        end do;
        n*a ;
end proc: # R. J. Mathar, Apr 05 2012
  • Mathematica
    a[ n_] := If[ Abs @ n < 2, 0, n Total[ #2 / #1 & @@@ FactorInteger[ Abs @ n]]]; (* Michael Somos, Apr 12 2011 *)
dn[0] = 0; dn[1] = 0; dn[n_?Negative] := -dn[-n]; dn[n_] := Module[{f = Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Total[n*f[[2]]/f[[1]]]]]; Table[dn[n], {n, 0, 100}] (* T. D. Noe, Sep 28 2012 *)
  • PARI
    A003415(n) = {local(fac);if(n<1,0,fac=factor(n);sum(i=1,matsize(fac)[1],n*fac[i,2]/fac[i,1]))} /* Michael B. Porter, Nov 25 2009 */
  • PARI
    apply( A003415(n)=vecsum([n/f[1]*f[2]|f<-factor(n+!n)~]), [0..99]) \\ M. F. Hasler, Sep 25 2013, updated Nov 27 2019
  • PARI
    A003415(n) = { my(s=0, m=1, spf); while(n>1, spf = A020639(n); n /= spf; s += m*n; m *= spf); (s); }; \\ Antti Karttunen, Mar 10 2021
  • PARI
    a(n) = my(f=factor(n), r=[1/(e+!e)|e<-f[,1]], c=f[,2]); n*r*c; \\ Ruud H.G. van Tol, Sep 03 2023
  • Python
    from sympy import factorint
def A003415(n):
    return sum([int(n*e/p) for p,e in factorint(n).items()]) if n > 1 else 0
# Chai Wah Wu, Aug 21 2014
  • Sage
    def A003415(n):
    F = [] if n == 0 else factor(n)
    return n * sum(g / f for f, g in F)
[A003415(n) for n in range(79)] # Peter Luschny, Aug 23 2014

Formula

If n = Product p_i^e_i, a(n) = n * Sum (e_i/p_i).
a(m*p^p) = (m + a(m))*p^p, p prime: a(m*A051674(k))=A129283(m)*A051674(k). - Reinhard Zumkeller, Apr 07 2007
For n > 1: a(n) = a(A032742(n)) * A020639(n) + A032742(n). - Reinhard Zumkeller, May 09 2011
a(n) = n * Sum_{p|n} v_p(n)/p, where v_p(n) is the largest power of the prime p dividing n. - Wesley Ivan Hurt, Jul 12 2015
For n >= 2, Sum_{k=2..n} floor(1/a(k)) = pi(n) = A000720(n) (see K. T. Atanassov article). - Ivan N. Ianakiev, Mar 22 2019
From A.H.M. Smeets, Jan 17 2020: (Start)
Limit_{n -> oo} (1/n^2)*Sum_{i=1..n} a(i) = A136141/2.
Limit_{n -> oo} (1/n)*Sum_{i=1..n} a(i)/i = A136141.
a(n) = n if and only if n = p^p, where p is a prime number. (End)
Dirichlet g.f.: zeta(s-1)*Sum_{p prime} 1/(p^s-p), see A136141 (s=2), A369632 (s=3) [Haukkanen, Merikoski and Tossavainen]. - Sebastian Karlsson, Nov 25 2021
From Antti Karttunen, Nov 25 2021: (Start)
a(n) = Sum_{d|n} d * A349394(n/d).
For all n >= 1, A322582(n) <= a(n) <= A348507(n).
If n is not a prime, then a(n) >= 2*sqrt(n), or in other words, for all k >= 1 for which A002620(n)+k is not a prime, we have a(A002620(n)+k) > n. [See Ufnarovski and Åhlander, Theorem 9, point (3).]
(End)

Extensions

More terms from Michel ten Voorde, Apr 11 2001

A099302 Number of integer solutions to x' = n, where x' is the arithmetic derivative of x.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 1, 1, 2, 0, 2, 1, 2, 1, 3, 0, 2, 1, 2, 2, 3, 0, 4, 1, 3, 1, 2, 0, 3, 2, 4, 1, 4, 0, 4, 0, 2, 2, 3, 1, 4, 1, 4, 2, 4, 0, 6, 1, 4, 1, 3, 0, 5, 2, 4, 0, 4, 1, 7, 2, 3, 1, 5, 0, 6, 0, 3, 1, 5, 2, 7, 1, 5, 3, 5, 1, 7, 0, 6, 2, 5, 0, 8, 1, 5, 2, 4, 0, 9, 3, 6, 0, 5, 1, 8, 0, 3, 1, 6, 2, 8, 2, 5, 1, 6
Offset: 2

Views

Author

T. D. Noe, Oct 12 2004, Apr 24 2011

Keywords

Comments

This is the i(n) function in the paper by Ufnarovski and Ahlander. Note that a(1) is infinite because all primes satisfy x' = 1. The plot shows the great difference in the number of solutions for even and odd n. Also compare sequence A189558, which gives the least number have n solutions, and A189560, which gives the least such odd number.
It appears that there are a finite number of even numbers having a given number of solutions. This conjecture is explored in A189561 and A189562.

References

Links

Crossrefs

Cf. A002620, A003415 (arithmetic derivative of n), A099303 (greatest x such that x' = n), A098699 (least x such that x' = n), A098700 (n such that x' = n has no integer solution), A239433 (n such that x' = n has at least one solution).
Cf. A002375 (a lower bound for even n), A369054 (a lower bound for n of the form 4m+3).

Programs

  • Haskell
    a099302 n = length $ filter (== n) $ map a003415 [1 .. a002620 n]
-- Reinhard Zumkeller, Mar 18 2014
  • Mathematica
    dn[0]=0; dn[1]=0; dn[n_]:=Module[{f=Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Plus@@(n*f[[2]]/f[[1]])]]; d1=Table[dn[n], {n, 40000}]; Table[Count[d1, n], {n, 2, 400}]
  • PARI
    up_to = 100000; \\ A002620(10^5) = 2500000000
A002620(n) = ((n^2)>>2);
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A099302list(up_to) = { my(d,c,v=vector(up_to)); for(i=1, A002620(up_to), d = A003415(i); if(d>1 && d<=up_to, v[d]++)); (v); };
v099302 = A099302list(up_to);
A099302(n) = v099302[n]; \\ Antti Karttunen, Jan 21 2024
  • Python
    from sympy import factorint
def A099302(n): return sum(1 for m in range(1,(n**2>>2)+1) if sum((m*e//p for p,e in factorint(m).items())) == n) # Chai Wah Wu, Sep 12 2022

Formula

a(A098700(n)) = 0; a(A239433(n)) > 0. - Reinhard Zumkeller, Mar 18 2014
From Antti Karttunen, Jan 21 2024: (Start)
a(n) = Sum_{i=1..A002620(n)} [A003415(i)==n], where [ ] is the Iverson bracket.
a(2n) >= A002375(n), a(2n+1) >= A369054(2n+1).
(End)

A099303 Greatest integer x such that x' = n, or 0 if there is no such x, where x' is the arithmetic derivative of x.

Original entry on oeis.org

0, 0, 4, 6, 9, 10, 15, 14, 25, 0, 35, 22, 49, 26, 55, 0, 77, 34, 91, 38, 121, 0, 143, 46, 169, 27, 187, 0, 221, 58, 247, 62, 289, 0, 323, 0, 361, 74, 391, 42, 437, 82, 403, 86, 529, 0, 551, 94, 589, 63, 667, 0, 713, 106, 703, 0, 841, 70, 899, 118, 961, 122, 943, 0, 1073, 0
Offset: 2

Views

Author

T. D. Noe, Oct 12 2004

Keywords

Comments

This is the largest member of the set I(n) in the paper by Ufnarovski and Ahlander. They show that a(n) <= (n/2)^2.
Because this sequence is quite different for even and odd n, it is bisected into A102084 and A189762. The upper bound for odd n appears to be (n/3)^(3/2), which is attained when n = 3p^2 for primes p>5. - T. D. Noe, Apr 27 2011

References

Links

Crossrefs

Cf. A003415 (arithmetic derivative of n), A099302 (number of solutions to x' = n), A098699 (least x such that x' = n), A098700 (n such that x' = n has no integer solution).

Programs

  • Mathematica
    dn[0]=0; dn[1]=0; dn[n_]:=Module[{f=Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Plus@@(n*f[[2]]/f[[1]])]]; d1=Table[dn[n], {n, 40000}]; Table[x=Max[Flatten[Position[d1, n]]]; If[x>-Infinity, x, 0], {n, 2, 400}]
  • Python
    from sympy import factorint
def A099303(n):
    for m in range(n**2>>2,0,-1):
        if sum((m*e//p for p,e in factorint(m).items())) == n:
            return m
    return 0 # Chai Wah Wu, Sep 12 2022

A098699 Anti-derivative of n: or the first occurrence of n in A003415, or zero if impossible.

Original entry on oeis.org

1, 2, 0, 0, 4, 6, 9, 10, 15, 14, 21, 0, 8, 22, 33, 26, 12, 0, 65, 34, 51, 18, 57, 0, 20, 46, 69, 27, 115, 0, 161, 30, 16, 62, 93, 0, 155, 0, 217, 45, 111, 42, 185, 82, 24, 50, 129, 0, 44, 94, 141, 63, 235, 0, 329, 75, 52, 0, 265, 70, 36, 66, 177, 122, 183, 0, 305, 0, 40, 134
Offset: 0

Views

Author

Robert G. Wilson v, Sep 21 2004

Keywords

Comments

With Goldbach's conjecture, any even integer n = 2k > 2 can be written as sum of two primes, n = p + q, and therefore admits N = pq as (not necessarily smallest) anti-derivative, so a(2k) > 0, and a(2k) <= pq <= k^2. [Remark inspired by L. Polidori.] - M. F. Hasler, Apr 09 2015
a(n) <= n^2/4 for n > 1. This is because if A003415(x) = n > 1, x = a*b for some a,b > 1, and then n = A003415(x) = a*A003415(b) + A003415(a)*b >= a + x/a >= 2*sqrt(x), i.e. x <= (n/2)^2. - Robert Israel, May 29 2023

Links

Crossrefs

Cf. A003415, A051674, zeros in A098700.

Programs

  • Maple
    ader:= proc(n) local t;
  n * add(t[2]/t[1], t = ifactors(n)[2])
end proc:
N:= 100: # for a(0) .. a(N)
V:= Array(0..N): count:= 0:
for x from 1 to N^2/4 while count < 100 do
  v:= ader(x);
  if v > 0 and v <= 100 and V[v] = 0 then
    count:= count+1; V[v]:= x;
  fi;
od:
convert(V,list); # Robert Israel, May 29 2023
  • Mathematica
    a[1] = 0; a[n_] := Block[{f = Transpose[ FactorInteger[ n]]}, If[ PrimeQ[n], 1, Plus @@ (n*f[[2]]/f[[1]])]]; b = Table[0, {70}]; b[[1]] = 1; Do[c = a[n]; If[c < 70 && b[[c + 1]] == 0, b[[c + 1]] = n], {n, 10^3}]; b
  • PARI
    A098699(n)=for(k=1,(n\2)^2+2,A003415(k)==n&&return(k)) \\ M. F. Hasler, Apr 09 2015
  • Python
    from sympy import factorint
def A098699(n):
    if n < 2:
        return n+1
    for m in range(1,(n**2>>2)+1):
        if sum((m*e//p for p,e in factorint(m).items())) == n:
            return m
    return 0 # Chai Wah Wu, Sep 12 2022

Formula

a(n) = n for { 4, 27, 3125, 823543, ... } = { p^p; p prime } = A051674.

A189483 Primes that are not the arithmetic derivative (A003415) of any integer.

Original entry on oeis.org

2, 3, 11, 17, 23, 29, 37, 47, 53, 67, 79, 83, 89, 97, 107, 127, 137, 149, 157, 163, 173, 179, 197, 223, 233, 257, 277, 307, 317, 337, 353, 367, 373, 379, 389, 397, 409, 443, 449, 457, 499, 509, 547, 569, 577, 593, 613, 659, 673, 677, 683, 709, 733, 757, 769
Offset: 1

Views

Author

T. D. Noe, Apr 22 2011

Keywords

Comments

These are the prime terms of A098700. Complement of A189441 in the primes.
If we consider rational numbers we can find anti-derivatives for these numbers: for instance 11385/4 = 2846+1/4 is an anti-derivative of 3. - Paolo P. Lava, Aug 02 2012

References

Links

Crossrefs

Cf. A003415, A098700, A099302.

Formula

Primes p such that A099302(p) = 0.

A327975 Breadth-first reading of the subtree rooted at 5 of the tree where each parent node is the arithmetic derivative (A003415) of all its children.

Original entry on oeis.org

5, 6, 9, 14, 33, 49, 62, 94, 177, 817, 961, 445, 913, 1633, 2173, 2209, 1146, 886, 1822, 4414, 19193, 25829, 32393, 41033, 47429, 57929, 64133, 88229, 101753, 111173, 116729, 129413, 138233, 148553, 160229, 173093, 183929, 188453, 208613, 216773, 232229, 235913, 244229, 249929, 257573, 262793, 272633, 278153, 282533, 288329, 294473, 304613, 316229, 320933, 322853, 323429, 327653, 328313, 1155, 2649
Offset: 1

Views

Author

Antti Karttunen, Oct 02 2019

Keywords

Comments

Permutation of A328115.
The branching degree of vertex v is given by A099302(v).
Leaves form a subsequence of A098700.
Most terms of A189760 (apart from 0, 1, 2, 414, ...) seem to be located in this tree, in positions where they have no smaller siblings.
For any number k at level n (where 5 is at level 2), we have A256750(k) = A327966(k) = n.
Question: Does this subtree contain infinitely long paths? How many? Cf. conjecture number 8 in Ufnarovski and Ahlander paper, and a similar tree starting from 7, A327977.

Examples

			Because we have A003415(5) = 1, A003415(6) = 5, A003415(9) = 6, A003415(14) = 9, A003415(33) = A003415(49) = 14, A003415(62) = 33, etc, this subtree is laid out as below. The terms of this sequence are obtained by scanning each successive level of the tree from left to right, from the node 5 onward:
   (0)
    |
   (1)
    |
    5
    |
    6
    |
    9
    |
    14________________
    |                 |
    33               49
    |                 |
    62________       94_____________________________
    |    |    |       |       |      |      |       |
    |    |    |       |       |      |      |       |
   177  817  961     445     913   1633   2173    2209
              |       |       |                     |
              |       |       |                     |
            1146     886    1822                  4414
              |       |       |                     |
              |       |       |                     |
            (19193,  (1155,  (19921, ..., 829921)  (22045, ..., 4870849)
             25829,   2649,                        [49 children for 4414]
               ...,  ...,    [27 children for 1822]
            328313)  196249)
                     [19 children for 886]
        [38 children
         for 1146]
The row lengths thus start as: 1, 1, 1, 1, 2, 2, 8, 4, 133 (= 38+19+27+49), ...

Links

Crossrefs

Cf. A003415, A098699, A098700, A099302, A099303, A099307, A099308, A189760, A256750, A327966, A327968, A328115.
Cf. A327977 for the subtree starting from 7, and also A263267 for another similar tree.

Programs

  • PARI
    A002620(n) = ((n^2)>>2);
A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
A327975list(e) = { my(lista=List([5]), f); for(n=1, e, f = lista[n]; for(k=1,1+A002620(f),if(A003415(k)==f, listput(lista,k)))); Vec(lista); };
v328975 = A327975list(21);
A327975(n) = v328975[n];
  • Sage
    # uses[A003415]
def A327975():
  '''Breadth-first reading of irregular subtree rooted at 5, defined by the edge-relation A003415(child) = parent.'''
  yield 5
  for x in A327975():
    for k in [1 .. 1+(x*x)//2]:
      if A003415(k) == x: yield k
def take(n, g):
  '''Returns a list composed of the next n elements returned by generator g.'''
  z = []
  if 0 == n: return z
  for x in g:
    z.append(x)
    if n > 1: n = n-1
    else: return(z)
take(60, A327975())

A327977 Breadth-first reading of the subtree rooted at 7 of the tree where each parent node is the arithmetic derivative (A003415) of all its children.

Original entry on oeis.org

7, 10, 21, 25, 18, 38, 46, 65, 77, 217, 361, 129, 205, 493, 529, 98, 426, 718, 170, 254, 462, 982, 1501, 2077, 2257, 2105, 2933, 6953, 11513, 14393, 16469, 17813, 19769, 21653, 24053, 25769, 27413, 29993, 34553, 35369, 41273, 42233, 42869, 44969, 45113, 45173, 11917, 27757, 38881, 45937, 62317, 76897, 84781, 102637, 111457, 114481, 117217, 118477, 120781, 127117, 128881, 501, 1141
Offset: 1

Views

Author

Antti Karttunen, Oct 02 2019

Keywords

Comments

Permutation of A328117.
The branching degree of vertex v is given by A099302(v).
Leaves form a subsequence of A098700.
For any number k at level n (where 7 is at level 2), we have A256750(k) = A327966(k) = n.
Question: Does this subtree contain infinitely long paths? How many? Cf. conjecture number 8 in Ufnarovski and Ahlander paper. As an example of possible beginning of such a sequence they give: 1 ← 7 ← 10 ← 25 ← 46 ← 129 ← 170 ← 501 ← 414 ← 2045.

Examples

			The subtree is laid out as below. The terms of this sequence are obtained by scanning each successive level of the tree from left to right, from the node 7 onward:
   (0)
    |
   (1)
    |
    7
    |
    10______________________________
    |                               |
    21________                     25
    |         |                     |
    18___    38_____               46_________________________________
    |    |    |     |               |            |      |             |
    65   77  217   361____         129____      205    493_____      529
         |          |     |         |     |             |      |
         98        426   718       170   254           462    982
         |          |     |         |     |             |      |
        [3]       [21]   [15]      [9]   [9]           [28]   [17]
On the last level illustrated above, the numbers in brackets [ ] tell how many children the node has. E.g, there are three for 98: 1501, 2077, 2257, as A003415(1501) = A003415(2077) = A003415(2257) = 98, and nine for 170: 501, 1141, 2041, 2869, 4309, 5461, 6649, 6901, 7081.

Links

Crossrefs

Cf. A003415, A098699, A098700, A099302, A099303, A099307, A099308, A189760, A256750, A327966, A327968, A328117.
Cf. A327975 for the subtree starting from 5, and also A263267 for another similar tree.

Programs

  • PARI
    A002620(n) = ((n^2)>>2);
A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
A327977list(e) = { my(lista=List([7]), f); for(i=1, e, f = lista[i]; for(k=1,1+A002620(f),if(A003415(k)==f, listput(lista,k)))); Vec(lista); };
  • PARI
    \\ With precomputed large A328117, use this:
v328117 = readvec("a328117.txt");
A327977list(e) = { my(lista=List([7]), f, i); for(n=1, e, f = lista[n]; print("n=",n," #lista=", #lista, " A002620(",f,")=",A002620(f)); my(u=1+A002620(f)); if(u>=v328117[#v328117],print("Not enough precomputed terms of A328117 as search upper limit ", u, " > ", v328117[#v328117], " (the last item in v328117). Number of expansions so far=", n); return(1/0)); i=1; while(v328117[i]A003415(v328117[i])==f, listput(lista,v328117[i])); i++)); Vec(lista); };
v327977 = A327977list(114);
A327977(n) = v327977[n];
for(n=1,#v327977,write("b327977.txt", n, " ", A327977(n)));
  • Sage
    # uses[A003415]
def A327977():
  '''Breadth-first reading of irregular subtree rooted at 7, defined by the edge-relation A003415(child) = parent. Starts giving terms from 7 onward, after a(0) = 0 and a(1) = 1.'''
  yield 7
  for x in A327977():
    for k in [1 .. 1+floor((x*x)/2)]:
      if(A003415(k) == x): yield k
def take(n, g):
  '''Returns a list composed of the next n elements returned by generator g.'''
  z = []
  if 0 == n: return(z)
  for x in g:
    z.append(x)
    if n > 1: n = n-1
    else: return(z)
take(52, A327977())

A239433 Numbers m with at least one integer solution for x' = m, where x' is the arithmetic derivative of x (cf. A003415).

Original entry on oeis.org

4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 58, 59, 60, 61, 62, 63, 64, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 80, 81
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 18 2014

Keywords

Comments

A099302(a(n)) > 0.

Links

Crossrefs

Cf. A002620, A098700 (complement), A369251 (subsequence).

Programs

  • Haskell
    a239433 n = a239433_list !! (n-1)
a239433_list = filter
   (\z -> any (== z) $ map a003415 $ takeWhile (<= a002620 z) a013929_list) [2..]

A369464 Numbers for which there is no representation as a sum (p*q + p*r + q*r) with three odd primes p <= q <= r.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 88
Offset: 1

Views

Author

Antti Karttunen, Jan 24 2024

Keywords

Crossrefs

Complement of A369251. Numbers not in A369252.
Union of A004773 and A369056.
Positions of 0's in A369054.
Cf. A098700, A369248, A369249, A369463 (subsequences).

Programs

  • PARI
    isA369251(n) = if(3!=(n%4),0, my(v = [3,3], ip = #v, r); while(1, r = (n-(v[1]*v[2])) / (v[1]+v[2]); if(r < v[2], ip--, ip = #v; if(1==denominator(r) && isprime(r), return(1))); if(!ip, return(0)); v[ip] = nextprime(1+v[ip]); for(i=1+ip,#v,v[i]=v[i-1])));
isA369464(n) = !isA369251(n);

A189762 Greatest integer x such that x' = 2n+1, or 0 if there is no such x, where x' is the arithmetic derivative (A003415).

Original entry on oeis.org

0, 6, 10, 14, 0, 22, 26, 0, 34, 38, 0, 46, 27, 0, 58, 62, 0, 0, 74, 42, 82, 86, 0, 94, 63, 0, 106, 0, 70, 118, 122, 0, 0, 134, 105, 142, 146, 98, 0, 158, 0, 166, 117, 0, 178, 0, 175, 0, 194, 130, 202, 206, 0, 214, 218, 154, 226, 0, 245, 138, 171, 0, 0, 254
Offset: 1

Views

Author

T. D. Noe, Apr 27 2011

Keywords

Comments

Bisection of A099303. In contrast to the sequence for even numbers, A102084, there appear to be an infinite number of zeros in this sequence (see A098700). The density of the zeros appears to be 1/3. Quite Often a(n) = 4n-2. For odd number 2n+1, an upper bound on the largest anti-derivative x appears to ((2n+1)/3)^(3/2).

Links

Crossrefs

Cf. A003415, A099303, A102084 (another bisection of A099303).

Programs

  • Mathematica
    dn[0] = 0; dn[1] = 0; dn[n_] := Module[{f = Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Plus @@ (n*f[[2]]/f[[1]])]]; nn = 100; d = Array[dn, (nn/2)^2]; Table[pos = Position[d, n]; If[pos == {}, 0, pos[[-1, 1]]], {n, 3, nn, 2}]
Showing 1-10 of 13 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.