Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038025
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038025 Winner of n-th Littlewood Frog Race. +0
8
1, 1, 1, 1, 4, 1, 1, 1, 1, 9, 10, 1, 12, 1, 1, 9, 1, 1, 1, 1, 4, 21, 22, 1, 24, 25, 1, 27, 27, 1, 1, 1, 16, 1, 16, 35, 32, 1, 38, 9, 10, 25, 33, 25, 1, 45, 27, 1, 25, 49, 44, 25, 24, 1, 1, 9, 34, 27, 1, 49, 24, 1, 58, 57, 64, 49, 8, 49, 65, 51, 48, 49, 72, 69, 68 (list; graph; listen)
OFFSET

1,5

COMMENT

For 0 < k <= n, gcd(n,k) = 1, let P(n,k) be the smallest prime of the form a*n+k, with a >= 0. "Frog" k0 is said to win "race" n if P(n,k0) is largest of the phi(n) values P(n,k)

CROSSREFS

Cf. A038026.

Sequence in context: A119350 A016528 A056623 this_sequence A079982 A039927 A073802

Adjacent sequences: A038022 A038023 A038024 this_sequence A038026 A038027 A038028

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net) from a problem by David W. Wilson (davidwwilson(AT)comcast.net)

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 July 25 02:12 EDT 2008. Contains 142294 sequences.


AT&T Labs Research