Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107623
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107623 Primes plus alternately 3 and 2. +0
1
5, 5, 8, 9, 14, 15, 20, 21, 26, 31, 34, 39, 44, 45, 50, 55, 62, 63, 70, 73, 76, 81, 86, 91, 100, 103, 106, 109, 112, 115, 130, 133, 140, 141, 152, 153, 160, 165, 170, 175, 182, 183, 194, 195, 200, 201, 214, 225, 230, 231, 236, 241, 244, 253, 260, 265, 272, 273 (list; graph; listen)
OFFSET

1,1

FORMULA

A107623(n) = prime(n) + (2 + mod(n, 2)).

MATHEMATICA

A107623[n_]:= Prime[n] + (2 + Mod[n, 2])

CROSSREFS

Cf. A107620, A107621, 107622.

Sequence in context: A141864 A141538 A003861 this_sequence A081287 A019843 A046567

Adjacent sequences: A107620 A107621 A107622 this_sequence A107624 A107625 A107626

KEYWORD

easy,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), May 18 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research