login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133416 (1/10)*(2^(4*n-3)-5^n*F(2*n-1)+L(4*n-2)), where F() = Fibonacci numbers A000045 and L() = Lucas numbers A000032. 0
0, 0, 1, 91, 3060, 74613, 1562275, 30045016, 548354601, 9669627915, 166514967388, 2819214031645, 47139484522131, 780855182286336, 12842348655153745, 210042772449096763, 3420451064885308740, 55509625058510689221, 898396209147305575171, 14508414020570344661800 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

REFERENCES

P. S. Bruckman, Problem H-650, Fib. Quart., 45 (2007), 91.

FORMULA

Equals Sum_{k = 0..floor((n-3)/5)} binomial(4n-2, 2n-10k-6).

CROSSREFS

Sequence in context: A118706 A119150 A008394 * A169937 A047697 A096054

Adjacent sequences:  A133413 A133414 A133415 * A133417 A133418 A133419

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 27 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:09 EST 2012. Contains 205614 sequences.