Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124125
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124125 a(n)=(1/(4n))*sum(k=1,n,F(6k)*B(2n-2k)*binomial(2n,2k)) where F=Fibonacci numbers and B=Bernoulli numbers. +0
1
2, 19, 245, 3631, 58121, 973843, 16773677, 293759095, 5196109073, 92455824667, 1650850175669, 29537478199039, 529130102195225, 9485447592486691, 170110949757514301, 3051485664370912903, 54745886982174938657 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=(1/4)*(F(6n-3)+4^n*F(2n-1)+2*5^(n-1))

PROGRAM

(PARI) a(n)=(1/4)*(fibonacci(6*n-3)+4^n*fibonacci(2*n-1)+2*5^(n-1))

CROSSREFS

Cf. A111262.

Adjacent sequences: A124122 A124123 A124124 this_sequence A124126 A124127 A124128

Sequence in context: A024227 A106945 A125632 this_sequence A065923 A094476 A119773

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 29 2006

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research