A330253 A variation of A330252: the same rules for a(n) apply with an additional rule a(n) = n if a(n-1) = 0. This sequence lists the n values where a(n) = 0.

3292, 4191, 4199, 4408, 4417, 4440, 4505, 4619, 4635, 4779, 4859, 4897, 5225, 5321, 5345, 5367, 5374, 5635, 6005, 6185, 6191, 6514, 6538, 6546, 6647, 6778, 6822, 6938, 6945, 7169, 7176, 7183, 7293, 7367, 7381, 7388, 7405, 7429, 7447, 7992, 8000, 8008, 8033, 8051, 8159, 8218, 8404

Offset: 1

Author

Scott R. Shannon, Dec 07 2019

Keywords

• nonn

Comments

Consider A330252(n) where we add an additional rule that a(n) = n if a(n-1) = 0. This allows this sequence to extend beyond a(3292) = 0 as now a(3293) = 3293, and the same multiplication or division rules based on the primality of n can continue.

This sequence lists all the values of n where such a sequence equals zero. Examining the gap between these zero values for n up to 10^7 shows the first run of nonzero terms, which starts at n = 1 and goes for 3291 more terms, is the longest such run of nonzero terms. See A330252. This is likely the longest such run for all n, although this is unknown. The next longest nonzero run up to n = 10^7 is 1226 which starts at n = 5690460.

Examining the average length of these nonzero runs for 10^4 to 10^5 terms starting at larger n values of 10^9, 10^12, 10^15 shows the average length is around 40. It is unknown if this approaches a constant as n goes to infinity or if it is dependent on the magnitude of n itself.

For n up to 10^7 there are 220026 runs of nonzero terms. The largest sequence value in this range is a 104-digit number reached at n = 1219963.

Examples

			a(3292) = 0. See A330252.
		

Crossrefs

Cf. A000040, A020639, A330252.

Programs

Mathematica

f[1] = 1; f[n_] := f[n] = If[f[n - 1] == 0, n, If[PrimeQ[n], n*f[n - 1], Floor[f[n - 1]/FactorInteger[n][[1, 1]]]]];  seq = {}; Do[If[f[n] == 0, AppendTo[seq, n]], {n, 1, 10^4}]; seq (* Amiram Eldar, Dec 07 2019 *)