login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158569 a(n) = Sum_{i=1..F(n)} F(i), n >= 1, where F(k) is A000045, Fibonacci numbers. 0

%I #8 Feb 02 2019 20:29:05

%S 1,1,2,4,12,54,609,28656,14930351,365435296161,4660046610375530308,

%T 1454489111232772683678306641952,

%U 5789092068864820527338372482892113982249794889764

%N a(n) = Sum_{i=1..F(n)} F(i), n >= 1, where F(k) is A000045, Fibonacci numbers.

%C a(14) has 79 digits. - _Emeric Deutsch_, Apr 05 2009

%p with(combinat); a := proc (n) options operator, arrow: add(fibonacci(i), i = 1 .. fibonacci(n)) end proc: seq(a(n), n = 1 .. 13); # _Emeric Deutsch_, Apr 05 2009

%t Total/@Table[Sum[Fibonacci[Range[i]],{i,{Fibonacci[n]}}],{n,14}] (* _Harvey P. Dale_, Aug 26 2013 *)

%Y Cf. A000045.

%K easy,nonn

%O 1,3

%A _Ctibor O. Zizka_, Mar 21 2009

%E More terms from _Emeric Deutsch_, Apr 05 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 17:03 EDT 2024. Contains 374410 sequences. (Running on oeis4.)