Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108990
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108990 Triangle, read by rows, where the g.f. of row n, R_n(x), is a polynomial of degree n that satisfies: [x^k] R_{n+1}(x) = [x^k] (1 + x*R_n(x))^(n+1) for k=0..n+1, with R_0(x) = 1. +0
7
1, 1, 1, 1, 2, 3, 1, 3, 9, 22, 1, 4, 18, 76, 287, 1, 5, 30, 180, 1025, 5496, 1, 6, 45, 350, 2670, 19656, 139727, 1, 7, 63, 602, 5761, 54096, 495964, 4447234, 1, 8, 84, 952, 10962, 125328, 1411228, 15629720, 170501039, 1, 9, 108, 1416, 19062, 257040 (list; table; graph; listen)
OFFSET

0,5

EXAMPLE

The g.f. of row 4 is: 1 + 4*x + 18*x^2 + 76*x^3 + 287*x^4

and equals the initial coefficients from [x^0] to [x^4] in:

(1+ x*R_3(x))^4 = (1 + x*(1 + 3*x + 9*x^2 + 22*x^3))^4.

Triangle begins:

1;

1,1;

1,2,3;

1,3,9,22;

1,4,18,76,287;

1,5,30,180,1025,5496;

1,6,45,350,2670,19656,139727;

1,7,63,602,5761,54096,495964,4447234;

1,8,84,952,10962,125328,1411228,15629720,170501039; ...

PROGRAM

(PARI) {T(n, k)=local(F=1+x*O(x^n)); if(n<k|k<0, 0, for(m=1, n, F=(1+x*F)^m); polcoeff(F, k))}

CROSSREFS

Cf. A108991, A108992, A108993, A108994, A108995, A108996.

Sequence in context: A111589 A010027 A151880 this_sequence A145080 A065078 A126744

Adjacent sequences: A108987 A108988 A108989 this_sequence A108991 A108992 A108993

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 15 2005

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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research