Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121971
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121971 a(n) is the smallest number such that pi(n) divides n a record-breaking prime number of times. +0
1
2, 27, 330, 3059, 175197, 1304498, 70115412, 514272411, 27788566029 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(3)=330 because pi(330)=66 and 330 divided by 66 is 5, the first prime greater than the prime quotient in a(2) which was 3.

CROSSREFS

Cf. A000720.

Sequence in context: A011543 A091709 A083384 this_sequence A121137 A153850 A138458

Adjacent sequences: A121968 A121969 A121970 this_sequence A121972 A121973 A121974

KEYWORD

more,nonn

AUTHOR

G. L. Honaker, Jr. (honak3r(AT)gmail.com), Sep 04 2006

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research