login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 1, 2, 4, 12, 54, 609, 28656, 14930351, 365435296161, 4660046610375530308, 1454489111232772683678306641952, 5789092068864820527338372482892113982249794889764 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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

LINKS

Table of n, a(n) for n=1..13.

MAPLE

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

MATHEMATICA

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

CROSSREFS

Cf. A000045.

Sequence in context: A075876 A222470 A227037 * A020106 A099928 A000568

Adjacent sequences:  A158566 A158567 A158568 * A158570 A158571 A158572

KEYWORD

easy,nonn

AUTHOR

Ctibor O. Zizka, Mar 21 2009

EXTENSIONS

More terms from Emeric Deutsch, Apr 05 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 18:21 EDT 2021. Contains 343808 sequences. (Running on oeis4.)