Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098532
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098532 Sum of sixth powers of first n Fibonacci numbers. +0
9
0, 1, 2, 66, 795, 16420, 278564, 5105373, 90871494, 1635675910, 29316316535, 526297607496, 9442398055752, 169448124595321, 3040546683808010, 54560921044808010, 979052407236876819, 17568407254504944748 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=(1/500)*(F(6n+1)+3*F(6n+2)-(-1)^n*(16*F(4n+1)+8*F(4n+2))-60*F(2n+1)+120*F(2n+2)-(-1)^n*40 where F(n)=A000045(n)

PROGRAM

(PARI) a(n)=sum(i=0, n, fibonacci(i)^6)

CROSSREFS

Cf. A001654, A005968, A005969, A098531, A098533.

Cf. A119287, A000071, A001654, A005968, A005969, A098531, A098533, A128697.

Adjacent sequences: A098529 A098530 A098531 this_sequence A098533 A098534 A098535

Sequence in context: A098089 A075809 A131472 this_sequence A069865 A092884 A119552

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 12 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research