login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069102 a(1) = 1; a(2) = 1; a(n) = Prime[n-1] + Prime[n-2] if n > 2. 1
1, 1, 5, 8, 12, 18, 24, 30, 36, 42, 52, 60, 68, 78, 84, 90, 100, 112, 120, 128, 138, 144, 152, 162, 172, 186, 198, 204, 210, 216, 222, 240, 258, 268, 276, 288, 300, 308, 320, 330, 340, 352, 360, 372, 384, 390, 396, 410, 434, 450, 456, 462, 472, 480, 492, 508 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

a(3) = Prime[2] + Prime[1] = 3 + 2 = 5.

PROG

(PARI) print1("1, 1, "):for(n=1, 100, print1(prime(n)+prime(n+1)", "))

CROSSREFS

Cf. A001043, A011974.

Sequence in context: A133795 A190708 A145285 * A001043 A118775 A025001

Adjacent sequences:  A069099 A069100 A069101 * A069103 A069104 A069105

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Apr 06 2002

EXTENSIONS

More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 20 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:27 EST 2012. Contains 205623 sequences.