A158569 a(n) = Sum_{i=1..F(n)} F(i), where F = A000045, Fibonacci numbers.

0, 1, 1, 2, 4, 12, 54, 609, 28656, 14930351, 365435296161, 4660046610375530308, 1454489111232772683678306641952, 5789092068864820527338372482892113982249794889764, 7191684930184179482016276395611672639105248126232175323349533708710427892956420

Offset: 0

Author

Ctibor O. Zizka, Mar 21 2009

Keywords

• nonn
• easy

Comments

a(14) has 79 digits. - Emeric Deutsch, Apr 05 2009

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..19

Crossrefs

Cf. A000045, A000071, A157725.

Programs

Maple

with(combinat): a := proc (n) options operator, arrow: add(fibonacci(i), i = 1 .. fibonacci(n)) end proc: seq(a(n), n = 0 .. 14); # Emeric Deutsch, Apr 05 2009
# second Maple program:
F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
a:= n-> F(F(n)+2)-1:
seq(a(n), n=0..14);  # Alois P. Heinz, Apr 14 2025

Mathematica

Total/@Table[Sum[Fibonacci[Range[i]],{i,{Fibonacci[n]}}],{n,14}] (* Harvey P. Dale, Aug 26 2013 *)

Formula

a(n) = A000071(A157725(n)). - Alois P. Heinz, Apr 14 2025

Extensions

More terms from Emeric Deutsch, Apr 05 2009