login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102426 Triangle read by rows giving coefficients of polynomials defined by F(0)=0, F(1)=1, F(n+1) = F(n) + x*F(n-1). 10
0, 1, 1, 1, 1, 2, 1, 1, 3, 1, 3, 4, 1, 1, 6, 5, 1, 4, 10, 6, 1, 1, 10, 15, 7, 1, 5, 20, 21, 8, 1, 1, 15, 35, 28, 9, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

F(n) + 2x * F(n-1) gives Lucas polynomials (cf. A034807). - Maxim Krikun (krikun(AT)iecn.u-nancy.fr), Jun 24 2007

Essentially the same as A098925. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 30 2008]

FORMULA

Alternatively, as n is even or odd: T(n-2, k) + T(n-1, k-1) = T(n, k) T(n-2, k) + T(n-1, k) = T(n, k)

T(n, k)=binomial(floor(n/2)+k, floor((n-1)/2-k) - Paul Barry (pbarry(AT)wit.ie), Jun 22 2005

EXAMPLE

The first few polynomials are:

0

1

1

x + 1

2x + 1

x^2 + 3x + 1

3x^2 + 4x + 1

CROSSREFS

Upward diagonals sums are A062200. Downward rows are A102427. Row sums are A000045. Row terms reversed = A011973. Also A102427, A102428, A102429.

All of A011973, A092865, A098925, A102426, A169803 describe essentially the same triangle in different ways. - N. J. A. Sloane, May 29 2011.

Sequence in context: A121560 A136405 A035667 * A092865 A098925 A052920

Adjacent sequences:  A102423 A102424 A102425 * A102427 A102428 A102429

KEYWORD

easy,nonn,tabf

AUTHOR

Russell Walsmith (russw(AT)lycos.com), Jan 08 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 13:08 EST 2012. Contains 205623 sequences.