Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133415
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133415 (1/10)*(2^(4*n-1)-5^n*L(2*n)+L(4*n)), where L() = Lucas numbers A000032. +0
1
0, 0, 12, 560, 15504, 346104, 6906900, 129024512, 2310796740, 40226003064, 686392118544, 11543525003120, 192052217662812, 3169185696976320, 51968632068982524, 848016349271816384, 13784507849163060240, 223382961205435729512, 3611184426083530971300, 58264040214444951056384 (list; graph; listen)
OFFSET

1,3

REFERENCES

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

FORMULA

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

O.g.f.: -4*x^3*(3+26*x+5*x^2)/((-1+16*x)*(1-15*x+25*x^2)*(1-7*x+x^2)) = -(1/20)+(1/10)*(-2+15*x)/(1-15*x+25*x^2)-(1/20)/(-1+16*x)+(1/10)*(2-7*x)/(1-7*x+x^2) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 28 2007

CROSSREFS

Sequence in context: A004801 A067733 A064344 this_sequence A042111 A013587 A126159

Adjacent sequences: A133412 A133413 A133414 this_sequence A133416 A133417 A133418

KEYWORD

nonn

AUTHOR

njas, Nov 27 2007

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 July 23 10:48 EDT 2008. Contains 142285 sequences.


AT&T Labs Research