Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075340
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075340 a(1) = 1; a(2n) is the smallest prime == 1 mod (a(2n-1)) and a(2n+1) is the smallest composite number == 1 (mod a(2n)). +0
2
1, 2, 9, 19, 20, 41, 42, 43, 44, 89, 90, 181, 182, 547, 548, 1097, 1098, 7687, 7688, 15377, 15378, 30757, 30758, 276823, 276824, 553649, 553650, 2768251, 2768252, 8304757, 8304758, 99657097, 99657098, 199314197, 199314198, 3189027169 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A075341.

Sequence in context: A006226 A109298 A075537 this_sequence A031316 A135207 A026541

Adjacent sequences: A075337 A075338 A075339 this_sequence A075341 A075342 A075343

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 18 2002

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Jan 16 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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research