|
Search: id:A064725
|
|
|
| A064725 |
|
Sum of primes dividing Fibonacci(n) (with repetition). |
|
+0
3
|
|
| 0, 0, 0, 2, 3, 5, 6, 13, 10, 19, 16, 89, 14, 233, 42, 68, 57, 1597, 42, 150, 60, 436, 288, 28657, 46, 3011, 754, 181, 326, 514229, 114, 2974, 2264, 19892, 5168, 141979, 160, 2443, 9499, 135956, 2228, 62158, 680, 433494437, 641, 109526, 29257, 2971215073
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,350
|
|
PROGRAM
|
(PARI) sopfr(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]*f[i, 2]); return(s) } { for (n = 0, 350, write("b064725.txt", n, " ", sopfr(fibonacci(n))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 23 2009]
|
|
CROSSREFS
|
Cf. A000045, A001414.
Sequence in context: A118787 A098930 A075372 this_sequence A100330 A020473 A098833
Adjacent sequences: A064722 A064723 A064724 this_sequence A064726 A064727 A064728
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 16 2001
|
|
|
Search completed in 0.002 seconds
|
