A097588 a(n)=floor(P(k)/P(n)) with P(k)=lesser Fortunate numbers for P(n)# (A055211).

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2

Offset: 2

Author

Pierre CAMI, Aug 29 2004

Keywords

• base
• nonn

Comments

Conjecture : a(n) is always < 8.

Examples

			a(11) = floor(73/31) = 2, A055211(11) = 73 prime(11) = 31,
2*3*5*7*11*13*17*19*23*29*31-73 is prime and 73 is the smallest odd number k such that p(11)# - k is prime.
		

Links

• Pierre CAMI, Table of n, a(n) for n = 2..2000

Crossrefs

Cf. A055211.