login
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, 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,10
COMMENTS
Conjecture : a(n) is always < 8.
EXAMPLE
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.
CROSSREFS
Cf. A055211.
Sequence in context: A328310 A136673 A283149 * A183017 A183014 A030382
KEYWORD
base,nonn
AUTHOR
Pierre CAMI, Aug 29 2004
STATUS
approved