A346153 a(n) = A346152(n!).

1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 5, 7, 5, 5, 5, 7, 5, 7, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7

Offset

1,2

Comments

Erdős and Selfridge (1982) proved that if f(n) = primepi(a(n)) (or, equivalently, a(n) = prime(f(n))), then |f(n+1) - f(n)| <= 1, and that for infinitely many values of n, f(n+1) = f(n) - 1.

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Paul Erdős, Miscellaneous problems in number theory, Proceedings of the Eleventh Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, Man., 1981), Congr. Numer., Vol. 34 (1982), pp. 25-45.

Paul Erdős and John L. Selfridge, Problem 6339, Advanced problems, The American Mathematical Monthly, Vol. 88, No. 4 (1981), p. 294; Factorizationf n!, solution to problem 6339, solved by the proposers, ibid., Vol. 89, No. 10 (1982), pp. 790-794.

Formula

a(n) = A346152(A000142(n)).

Lim_{n->oo} a(n)/sqrt(n) = exp(gamma - 1/2), where gamma is Euler's constant (A001620) (Erdős and Selfridge, 1982).

Mathematica

f[1] = 1; f[n_] := Module[{fct = FactorInteger[n], prods, ind}, prods = Rest @ FoldList[Times, 1, Power @@@ fct]; ind = FirstPosition[prods^2, _?(# > n &)][[1]]; fct[[ind, 1]]]; a[n_] := f[n!]; Array[a, 100]

Crossrefs

Cf. A000142, A001620, A073004, A346152.

Sequence in context: A091935 A086063 A145653 * A266119 A026263 A080098

Adjacent sequences: A346150 A346151 A346152 * A346154 A346155 A346156

Keyword

nonn

Author

Amiram Eldar, Jul 07 2021

Status

approved