Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097588
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097588 a(n)=floor(P(k)/P(n)) with P(k)=lesser Fortunate numbers for P(n)# (A055211). +0
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, 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; listen)
OFFSET

2,10

COMMENT

Conjecture : a(n) is alway < 8

CROSSREFS

Cf. A055211.

Sequence in context: A015776 A067461 A136673 this_sequence A030382 A120889 A092523

Adjacent sequences: A097585 A097586 A097587 this_sequence A097589 A097590 A097591

KEYWORD

base,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Aug 29 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research