|
| |
|
|
A110363
|
|
Beginning with 2, prime numbers such that successive differences are Fibonacci numbers.
|
|
1
| |
|
|
2, 3, 5, 7, 41, 43, 653, 661, 14931013, 14931157, 2880067194385747277, 2880067194385747279, 555565404227172761598401539087, 370959230771131880927453873620406224662533776582329191
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
MAPLE
| with(combinat): a[1]:=2: for n from 2 to 15 do p:=proc(k) if isprime(a[n-1]+fibonacci(k))=true then a[n-1]+fibonacci(k) else fi end: a[n]:=[seq(p(k), k=1..500)][1] od: seq(a[n], n=1..15); (Deutsch)
|
|
|
CROSSREFS
| Cf. A110364.
Sequence in context: A100891 A051857 A050654 * A090714 A048400 A090716
Adjacent sequences: A110360 A110361 A110362 * A110364 A110365 A110366
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 23 2005
|
|
|
EXTENSIONS
| More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 28 2005
|
| |
|
|
