Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163353
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163353 G.f.: A(x,y) = Sum_{n>=0,m>=0} (2^m-1)^n*x^n * log(1+y)^m/m!. +0
1
1, 1, 0, 1, 1, 0, 1, 4, 4, 1, 0, 1, 13, 44, 67, 56, 28, 8, 1, 0, 1, 40, 360, 1546, 4144, 7896, 11408, 12866, 11440, 8008, 4368, 1820, 560, 120, 16, 1, 0, 1, 121, 2680, 27550, 180096, 866432, 3308736, 10453960, 27991600, 64472200, 129002640, 225783740 (list; graph; listen)
OFFSET

0,8

FORMULA

T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(n,j)*C(2^j,k), k=0..2^n.

Row sums form A000371 (nondegenerate Boolean functions of n variables).

Main diagonal equals A134174 and is defined by the g.f.:

Sum_{n>=0} log(1 + (2^n-1)*x)^n/n!.

EXAMPLE

Triangle begins:

1,1;

0,1,1;

0,1,4,4,1;

0,1,13,44,67,56,28,8,1;

0,1,40,360,1546,4144,7896,11408,12866,11440,8008,4368,1820,560,120,16,1;

0,1,121,2680,27550,180096,866432,3308736,10453960,27991600,64472200,129002640,225783740,347370800,471435000,565722640,601080385,565722720,471435600,347373600,225792840,129024480,64512240,28048800,10518300,3365856,906192,201376,35960,4960,496,32,1; ...

PROGRAM

(PARI) T(n, k)=sum(j=0, n, (-1)^(n-j)*binomial(n, j)*binomial(2^j, k))

CROSSREFS

Cf. A000371 (row sums), A134174 (main diagonal).

Sequence in context: A102412 A048152 A070430 this_sequence A164612 A057270 A057278

Adjacent sequences: A163350 A163351 A163352 this_sequence A163354 A163355 A163356

KEYWORD

nonn,tabf

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 25 2009

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research