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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122594 Fibonacci-Prime type sequence: a(n+1)=Prime(a(n))+Prime(a(n-1)). 1
2, 5, 14, 54, 294, 2182, 21168, 258584, 3866528, 69094248, 1446704598, 34928585060, 959616504858, 29669964598708 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

EXAMPLE

Prime(2)+Prime(5)=3+11=14.

MAPLE

A122594 := proc(n) option remember: if(n=0)then return 2: elif(n=1)then return 5: else return ithprime(procname(n-1)) + ithprime(procname(n-2)): fi: end:

seq(A122594(n), n=0..8); # Nathaniel Johnston, Apr 26 2011

MATHEMATICA

Transpose[NestList[{#[[2]], Prime[ #[[1]]]+Prime[ #[[2]]]}&, {1, 2}, 13]][[2]]

CROSSREFS

Sequence in context: A000679 A081439 A052649 * A047136 A047042 A174795

Adjacent sequences:  A122591 A122592 A122593 * A122595 A122596 A122597

KEYWORD

more,nonn

AUTHOR

Carlos Alves (cjsalves(AT)gmail.com), Oct 29 2006

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 15 02:50 EST 2012. Contains 205694 sequences.