Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126159
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126159 a(n) = Sum_{k=0..n} C(2n,k)*A126155(n,k). +0
2
1, 12, 624, 72768, 15073536, 4879690752, 2275446779904, 1444596033404928, 1198103353905709056, 1257795823373397000192, 1630379271356490615619584, 2557344389023281412086693888, 4774145871907749099664809394176 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=4^n*Sum_[k, 0<=k<=n}2^(n-k)*3^k*A088874(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 21 2006

EXAMPLE

a(1) = 1*(1) + 2*(5) + 1*(1) = 12;

a(2) = 1*(7) + 4*(35) + 6*(55) + 4*(35) + 1*(7) = 624;

a(3) = 1*(139) + 6*(695) + 15*(1195) + 20*(1415) + 15*(1195) + 6*(695) + 1*(139) = 72768.

CROSSREFS

Cf. A126155.

Sequence in context: A042111 A159644 A013587 this_sequence A071307 A060612 A002196

Adjacent sequences: A126156 A126157 A126158 this_sequence A126160 A126161 A126162

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 20 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research