Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136463
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136463 Diagonal of square array A136462: a(n) = C((n+1)*2^(n-1), n) for n>=0. +0
3
1, 2, 15, 560, 91390, 61124064, 163995687856, 1756185841659392, 75079359427627897200, 12831653340946454374300160, 8777916355714456994772455584000, 24054320541767107204031746600673906688 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n) is divisible by (n+1) for n>=0: a(n)/(n+1) = A136464(n).

FORMULA

a(n) = [x^n] Sum_{i>=0} ((n+1)/2)^i * log(1 + 2^i*x)^i/i!. a(n) is found in row n, column 0, of matrix power A136467^(n+1) for n>=0.

PROGRAM

(PARI) {a(n)=binomial((n+1)*2^(n-1), n)} (PARI) /* a(n) = Coefficient of x^n in series: */ {a(n)=polcoeff(sum(i=0, n, ((n+1)/2)^i*log(1+2^i*x +x*O(x^n))^i/i!), n)}

CROSSREFS

Cf. A136462; A136464; rows: A136465, A014070, A136466, A101346; A136467.

Adjacent sequences: A136460 A136461 A136462 this_sequence A136464 A136465 A136466

Sequence in context: A012943 A013059 A013098 this_sequence A078475 A015185 A071627

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 31 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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research