Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073627
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073627 a(1)=a(2)=1; for n > 2, a(n) is the smallest integer such that a(n) > a(n-1) and a(n)+a(n-1) is prime. +0
7
1, 1, 2, 3, 4, 7, 10, 13, 16, 21, 22, 25, 28, 31, 36, 37, 42, 47, 50, 51, 52, 55, 58, 69, 70, 79, 84, 89, 90, 91, 100, 111, 112, 115, 118, 121, 130, 133, 136, 141, 142, 151, 156, 157, 160, 171, 176, 177, 182, 185, 188, 191, 192, 197, 200, 201, 208, 211, 220, 223 (list; graph; listen)
OFFSET

1,3

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

Matthew M. Conroy, Home page (listed instead of email address)

MATHEMATICA

s=1; Join[{1, 1}, Table[k=s+1; While[ !PrimeQ[k+s], k++ ]; s=k, {100}]] [From T. D. Noe (noe(AT)sspectra.com), Nov 02 2009]

CROSSREFS

Cf. A073628.

Sequence in context: A082008 A105330 A097545 this_sequence A062042 A107817 A008811

Adjacent sequences: A073624 A073625 A073626 this_sequence A073628 A073629 A073630

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 08 2002

EXTENSIONS

Edited by Matthew M. Conroy, Oct 21 2002

Definition corrected by T. D. Noe (noe(AT)sspectra.com), Nov 02 2009

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research