|
|
A107327
|
|
Prime Fibonacci sequence: each term is the prime with index equal to the sum of the previous two terms.
|
|
3
|
|
|
2, 3, 11, 43, 251, 1931, 19237, 239347, 3627181, 65467067, 1381237531, 33547347529, 926069157329, 28743895441379, 993969849468227, 37991369810680411, 1593993722216820553
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
a(n) = prime(a(n-1) + a(n-2)); a(1) = 2; a(2) = 3.
|
|
EXAMPLE
|
a(5) = prime(11 + 43) = prime(54) = 251.
|
|
MATHEMATICA
|
t = {2, 3}; Do[AppendTo[t, Prime[t[[-1]] + t[[-2]]]], {9}]; t (* T. D. Noe, May 09 2013 *)
nxt[{a_, b_}]:={b, Prime[a+b]}; NestList[nxt, {2, 3}, 13][[All, 1]] (* Harvey P. Dale, Jul 18 2020 *)
|
|
PROG
|
(PARI) a(n) = if(n<3, prime(n), prime(a(n-1) + a(n-2)));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Christopher M. Tomaszewski (cmt1288(AT)comcast.net), May 22 2005
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|