|
Search: id:A065398
|
|
|
| A065398 |
|
Fibonacci numbers whose digits sum to a prime. |
|
+0
2
|
|
| 2, 3, 5, 21, 34, 89, 377, 610, 2584, 17711, 75025, 121393, 196418, 514229, 832040, 1346269, 5702887, 63245986, 165580141, 433494437, 1134903170, 2971215073, 20365011074, 53316291173, 86267571272, 591286729879, 2504730781961
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,100
|
|
PROGRAM
|
(PARI) SumD(x)= { local(s=0); while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } { n=0; for (m=1, 10^9, f=fibonacci(m); if (isprime(SumD(f)), write("b065398.txt", n++, " ", f); if (n==100, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 18 2009]
|
|
CROSSREFS
|
Sequence in context: A076383 A024766 A058959 this_sequence A084838 A051694 A113650
Adjacent sequences: A065395 A065396 A065397 this_sequence A065399 A065400 A065401
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Nov 22 2001
|
|
|
Search completed in 0.002 seconds
|
