|
Search: id:A119737
|
|
|
| A119737 |
|
a(n) = Sum{k=1..n} Fibonacci(floor(n/k)). |
|
+0
1
|
|
| 1, 2, 4, 6, 9, 14, 20, 30, 45, 69, 104, 165, 255, 405, 642, 1029, 1640, 2645, 4243, 6852, 11040, 17840, 28787, 46567, 75227, 121685, 196725, 318269, 514688, 832760, 1346990, 2179417, 3525722, 5704642, 9229228, 14933176, 24160642, 39092592
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
FORMULA
|
a(n) also equals n + sum{k=1..n-2} Fibonacci(k) floor(n/(k+2)), for n >= 2.
|
|
MATHEMATICA
|
f[n_] := Sum[ Fibonacci@Floor[n/k], {k, n}] (* or *) f[n_] := n + Sum[Fibonacci@k*Floor[n/(k + 2)], {k, n - 2}]; Array[f, 38] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A153140 A139135 A097197 this_sequence A038718 A042942 A005687
Adjacent sequences: A119734 A119735 A119736 this_sequence A119738 A119739 A119740
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Jun 15 2006
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com) and Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Jun 19 2006
|
|
|
Search completed in 0.002 seconds
|
