A351259 -id:A351259 - cp's OEIS frontend

A099308 Numbers m whose k-th arithmetic derivative is zero for some k. Complement of A099309.

0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 17, 18, 19, 21, 22, 23, 25, 29, 30, 31, 33, 34, 37, 38, 41, 42, 43, 46, 47, 49, 53, 57, 58, 59, 61, 62, 65, 66, 67, 70, 71, 73, 77, 78, 79, 82, 83, 85, 89, 93, 94, 97, 98, 101, 103, 105, 107, 109, 113, 114, 118, 121, 126, 127, 129, 130

Offset: 1

T. D. Noe, Oct 12 2004

nonn

The first derivative of 0 and 1 is 0. The second derivative of a prime number is 0.

For all n, A003415(a(n)) is also a term of the sequence. A351255 gives the nonzero terms as ordered by their position in A276086. - Antti Karttunen, Feb 14 2022

			18 is on this list because the first through fifth derivatives are 21, 10, 7, 1, 0.

See A003415.

T. D. Noe, Table of n, a(n) for n = 1..10000
Victor Ufnarovski and Bo Åhlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003, #03.3.4.

Cf. A003415 (arithmetic derivative of n), A099307 (least k such that the k-th arithmetic derivative of n is zero), A099309 (complement, numbers whose k-th arithmetic derivative is nonzero for all k), A351078 (first noncomposite reached when iterating the derivative from these numbers), A351079 (the largest term on such paths).
Cf. A328308, A328309 (characteristic function and their partial sums), A341999 (1 - charfun).
Cf. A276086, A328116, A351255 (permutation of nonzero terms), A351257, A351259, A351261, A351072 (number of prime(k)-smooth terms > 1).
Cf. also A256750 (number of iterations needed to reach either 0 or a number with a factor of the form p^p), A327969, A351088.
Union of A359544 and A359545.

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}]; nLim=200; lst={1}; i=1; While[i<=Length[lst], currN=lst[[i]]; pre=Intersection[Flatten[Position[d1, currN]], Range[nLim]]; pre=Complement[pre, lst]; lst=Join[lst, pre]; i++ ]; Union[lst]

\\ The following program would get stuck in nontrivial loops. However, we assume that the conjecture 3 in Ufnarovski & Åhlander paper holds ("The differential equation n^(k) = n has only trivial solutions p^p for primes p").
A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
isA099308(n) = if(!n, 1, while(n>1, n = A003415checked(n)); (n)); \\ Antti Karttunen, Feb 14 2022

For all n >= 0, A328309(a(n)) = n. - Antti Karttunen, Feb 14 2022

A351255 Numbers whose k-th arithmetic derivative is zero for some k>0, ordered by their position in A276086.

Original entry on oeis.org

1, 2, 3, 6, 9, 18, 5, 10, 30, 25, 150, 375, 750, 5625, 7, 14, 21, 42, 126, 70, 105, 315, 350, 1575, 3150, 1750, 2625, 49, 98, 882, 490, 735, 4410, 2450, 3675, 11025, 12250, 30625, 61250, 183750, 686, 3430, 5145, 25725, 77175, 385875, 1929375, 3858750, 4802, 72030, 120050, 180075, 33614, 100842, 117649, 705894, 26471025

Offset: 1

Antti Karttunen, Feb 10 2022

Equal to nonzero terms of A099308 when sorted into ascending order. In this order, which is dictated by the primorial base expansion of n (A049345) and mapped to products of prime powers by A276086, all terms of A099308 that are prime(k)-smooth appear before the terms that are not prime(k)-smooth.
Number of terms whose greatest prime factor (A006530) is prime(n) [in other words, that are prime(n)-smooth but not prime(n-1)-smooth] is given by A351071(n): 1, 4, 8, 44, 216, 1474, 11130, ...
For all n > 1, A003415(a(n)) is also a term of the sequence.
Note that only 451 of the first 105367 terms (all 19-smooth terms) are such that there occurs a 19-smooth number (A080682) larger than 1 on the path before 1 is encountered, when starting from x = a(n) and iterating with map x -> A003415(x).

Antti Karttunen, Table of n, a(n) for n = 1..12878 (all 17-smooth terms of this sequence)
Antti Karttunen, 105368 initial terms, without indices (all 19-smooth terms of this sequence, and also A276086(9699690) = 23, the first 23-smooth term)
Index entries for sequences related to primorial base

Cf. A003415, A049345, A099307, A099308, A276086, A328116, A351071, A351072 (number of prime(n)-smooth terms).

Cf. A351256 [= A051903(a(n))], A351257 [= A099307(a(n))], A351258, A351259 [= A351078(a(n))], A351261 [= A351079(a(n))].

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A099307(n) = { my(s=1); while(n>1, n = A003415checked(n); s++); if(n,s,0); };
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
for(n=0, 2^9, u=A276086(n); c = A099307(u); if(c>0,print1(u, ", ")));

a(n) = A276086(A328116(n)).

A351257 Least k such that the k-th arithmetic derivative of A351255(n) is zero.

Original entry on oeis.org

1, 2, 2, 3, 4, 5, 2, 3, 3, 4, 5, 6, 5, 6, 2, 5, 4, 3, 4, 3, 3, 4, 5, 4, 4, 7, 12, 6, 7, 4, 4, 4, 4, 4, 4, 4, 5, 8, 8, 6, 5, 12, 5, 5, 5, 8, 10, 6, 6, 6, 7, 6, 7, 7, 8, 12, 8, 12, 2, 3, 6, 3, 3, 4, 4, 5, 4, 4, 4, 8, 5, 5, 6, 12, 6, 3, 3, 7, 3, 3, 10, 3, 4, 5, 5, 4, 4, 6, 4, 4, 4, 6, 5, 5, 6, 5, 9, 5, 6, 10, 7, 7, 7

Offset: 1

Antti Karttunen, Feb 11 2022

a(n) is the number of iterations of the map x -> A003415(x) needed to reach zero, when starting from x = A351255(n).

			From A351255(27) = 2625 it takes 12 iterations of map x -> A003415(x) to reach zero, as 2625 -> 2825 -> 1155 -> 886 -> 445 -> 94 -> 49 -> 14 -> 9 -> 6 -> 5 -> 1 -> 0, therefore a(27) = 12.

Antti Karttunen, Table of n, a(n) for n = 1..105368 (computed for all 19-smooth terms of A351255, and also for A276086(9699690) = 23)

Cf. A003415, A099307, A276086, A351255, A351256, A351258, A351259, A351261.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A099307(n) = { my(s=1); while(n>1, n = A003415checked(n); s++); if(n,s,0); };
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
for(n=0, 2^9, u=A276086(n); c = A099307(u); if(c>0,print1(c, ", ")));

a(n) = A099307(A351255(n)).

For all n, a(n) > A351256(n). [See A351258 for the differences].

A351261 a(n) is the largest term encountered on the path to 0 when iterating the map x -> x', and starting from x = A351255(n). Here x' means the arithmetic derivative of x, A003415.

Original entry on oeis.org

1, 2, 3, 6, 9, 21, 5, 10, 31, 25, 185, 375, 1075, 12575, 7, 14, 21, 42, 165, 70, 105, 318, 365, 1905, 5385, 2175, 2825, 49, 98, 1281, 490, 735, 7287, 2905, 3745, 17747, 16975, 43075, 107150, 370705, 686, 3871, 5145, 29953, 115395, 1001035, 4475975, 11285575, 5145, 115591, 176645, 234955, 40817, 156065, 156065, 1193297

Offset: 1

Antti Karttunen, Feb 11 2022

At point n=104776, where a(104776) = 6121569170076203821789253759640129542895524171255601586612637263670135

and A351255(104776) = 144537549602172859330715888995919357193998109417395984504745753750, the ratio a(n)/A351255(n) obtains another record (~ 42352.7947), which motivates a conjecture that it is not bound from above. See also A351079.

			From A351255(27) = 2625 it takes 12 iterations of map x -> A003415(x) to reach zero: 2625 -> 2825 -> 1155 -> 886 -> 445 -> 94 -> 49 -> 14 -> 9 -> 6 -> 5 -> 1 -> 0. The largest term on this path is 2825, therefore a(27) = 2825.

Antti Karttunen, Table of n, a(n) for n = 1..12878 (computed for all 17-smooth terms of A351255)
Antti Karttunen, 105368 initial terms, without indices (computed for all 19-smooth terms of A351255, and also for A276086(9699690) = 23)

Cf. A003415, A276086, A351079, A351255, A351257, A351259.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A351079(n) = { my(m=n); while(n>1, n = A003415checked(n); m = max(m,n)); if(n,m); };
for(n=0, 2^9, u=A276086(n); m = A351079(u); if(m>0,print1(m, ", ")));

a(n) = A351079(A351255(n)).

A351078 First noncomposite number reached when iterating the map x -> x', when starting from x = n, or 0 if no such number is ever reached. Here x' is the arithmetic derivative of x, A003415.

Original entry on oeis.org

0, 1, 2, 3, 0, 5, 5, 7, 0, 5, 7, 11, 0, 13, 5, 0, 0, 17, 7, 19, 0, 7, 13, 23, 0, 7, 0, 0, 0, 29, 31, 31, 0, 5, 19, 0, 0, 37, 7, 0, 0, 41, 41, 43, 0, 0, 7, 47, 0, 5, 0, 0, 0, 53, 0, 0, 0, 13, 31, 59, 0, 61, 5, 0, 0, 7, 61, 67, 0, 0, 59, 71, 0, 73, 0, 0, 0, 7, 71, 79, 0, 0, 43, 83, 0, 13, 0, 0, 0, 89, 0, 0, 0, 19, 5

Offset: 0

Antti Karttunen, Feb 11 2022

Primes of A189483 occur only once, on the corresponding indices, while A189441 may also occur in other positions.

There are interesting white "filament-like regions" in the scatter plot.

			For n = 15, if we iterate with A003415, we get a path 15 -> 8 -> 12 -> 16 -> 32 -> 80 -> 176 -> 368 -> ..., where the terms just keep on growing without ever reaching a prime or 1, therefore a(15) = 0.
For n = 18, its path down to zero, when iterating A003415 is: 18 -> 21 -> 10 -> 7 -> 1 -> 0, and the first noncomposite term on the path is prime 7, therefore a(18) = 7.

Antti Karttunen, Table of n, a(n) for n = 0..65537

Cf. A003415, A189441, A189483, A351079, A351259 [= a(A351255(n))].
Cf. A099309 (positions of zeros after the initial one at a(0)=0), A328115 (positions of 5's), A328117 (positions of 7's).
Cf. also A327968.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A351078(n) = { while(n>1&&!isprime(n), n = A003415checked(n)); (n); };

For all n, a(4*n) = a(27*n) = a((p^p)*n) = a(A099309(n)) = 0.

a(p) = p for all primes p.

cp's OEIS Frontend

A099308 Numbers m whose k-th arithmetic derivative is zero for some k. Complement of A099309.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A351255 Numbers whose k-th arithmetic derivative is zero for some k>0, ordered by their position in A276086.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A351257 Least k such that the k-th arithmetic derivative of A351255(n) is zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A351261 a(n) is the largest term encountered on the path to 0 when iterating the map x -> x', and starting from x = A351255(n). Here x' means the arithmetic derivative of x, A003415.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A351078 First noncomposite number reached when iterating the map x -> x', when starting from x = n, or 0 if no such number is ever reached. Here x' is the arithmetic derivative of x, A003415.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula