Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107060 a(n) = smallest number m >=0 such that n*prime(n)-m is a prime. +0
2
0, 1, 2, 5, 2, 5, 6, 1, 8, 7, 4, 1, 10, 1, 4, 9, 6, 1, 14, 11, 2, 5, 2, 5, 2, 5, 4, 25, 24, 1, 6, 15, 2, 3, 6, 5, 2, 21, 22, 3, 6, 11, 4, 25, 2, 3, 10, 13, 4, 3, 16, 7, 10, 1, 28, 5, 2, 35, 4, 17, 6, 17, 8, 13, 4, 1, 6, 9, 14, 9, 6, 1, 8, 19, 14, 7, 6, 17, 12, 1, 2, 3, 2, 19, 2, 15, 16, 3, 6, 1, 6 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A107061.

Sequence in context: A082881 A104289 A087272 this_sequence A016589 A089122 A121311

Adjacent sequences: A107057 A107058 A107059 this_sequence A107061 A107062 A107063

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), May 10 2005

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 September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research