login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097587 a(n)= floor(P(k)/P(n)) with P(k)=Fortunate prime numbers for P(n)# (A005235). 0
1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

Conjecture : a(n) is alway < 8

CROSSREFS

Cf. A005235.

Sequence in context: A063686 A008327 A133687 * A001179 A001876 A033182

Adjacent sequences:  A097584 A097585 A097586 * A097588 A097589 A097590

KEYWORD

base,nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)bbox.fr), Aug 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:03 EST 2012. Contains 205852 sequences.