login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,10

COMMENTS

Conjecture : a(n) is always < 8.

LINKS

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

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

Adjacent sequences:  A097585 A097586 A097587 * A097589 A097590 A097591

KEYWORD

base,nonn

AUTHOR

Pierre CAMI, Aug 29 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 28 13:26 EDT 2021. Contains 348329 sequences. (Running on oeis4.)