Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116071
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116071 Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k). +0
2
1, 1, 1, 3, 2, 1, 10, 9, 3, 1, 41, 40, 18, 4, 1, 196, 205, 100, 30, 5, 1, 1057, 1176, 615, 200, 45, 6, 1, 6322, 7399, 4116, 1435, 350, 63, 7, 1, 41393, 50576, 29596, 10976, 2870, 560, 84, 8, 1, 293608, 372537, 227592, 88788, 24696, 5166, 840, 108, 9, 1 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Column 0 = A000248 (Number of forests with n nodes and height at most 1). Column 1 = A052512 (Number of labeled trees of height 2). Row sums = A080108 (Sum_{k=1..n} k^(n-k)*C(n-1,k-1)). Central terms = A116072(n) = (n+1)*A000108(n)*A000248(n).

FORMULA

E.g.f. wrt x: A(x,y) = exp(x*exp(x)+x*y).

EXAMPLE

Triangle begins:

1;

1,1;

3,2,1;

10,9,3,1;

41,40,18,4,1;

196,205,100,30,5,1;

1057,1176,615,200,45,6,1;

6322,7399,4116,1435,350,63,7,1;

41393,50576,29596,10976,2870,560,84,8,1;

293608,372537,227592,88788,24696,5166,840,108,9,1; ...

PROGRAM

(PARI) {T(n, k)=local(X=x+x*O(x^n), Y=y+y*O(y^k)); n!*polcoeff(polcoeff(exp(X*exp(X)+X*Y), n, x), k, y)}

CROSSREFS

Cf. A000248, A052512, A080108, A116072.

Sequence in context: A100100 A102472 A101894 this_sequence A077756 A115080 A104219

Adjacent sequences: A116068 A116069 A116070 this_sequence A116072 A116073 A116074

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Feb 03 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 September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research