Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102426
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
5
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; listen)
OFFSET

0,6

COMMENT

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

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.

Sequence in context: A121560 A136405 A035667 this_sequence A092865 A098925 A052920

Adjacent sequences: A102423 A102424 A102425 this_sequence A102427 A102428 A102429

KEYWORD

easy,nonn,tabf

AUTHOR

Russell Walsmith (russw(AT)lycos.com), Jan 08 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research