Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110023
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110023 A triangle of coefficients based on A000931 and the Pascal's triangle: a(n)=a(n-2)+a(n-3); t(n,m)=a(n - m + 1)*a(m + 1)*Binomial[n, m]. +0
1
1, 1, 1, 2, 2, 2, 2, 6, 6, 2, 3, 8, 24, 8, 3, 4, 15, 40, 40, 15, 4, 5, 24, 90, 80, 90, 24, 5, 7, 35, 168, 210, 210, 168, 35, 7, 9, 56, 280, 448, 630, 448, 280, 56, 9, 12, 81, 504, 840, 1512, 1512, 840, 504, 81, 12, 16, 120, 810, 1680, 3150, 4032, 3150, 1680, 810, 120, 16 (list; table; graph; listen)
OFFSET

1,4

COMMENT

Row sums are:

{1, 2, 6, 16, 46, 118, 318, 840, 2216, 5898, 15584}

FORMULA

a(n)=a(n-2)+a(n-3); t(n,m)=a(n - m + 1)*a(m + 1)*Binomial[n, m].

EXAMPLE

{1},

{1, 1},

{2, 2, 2},

{2, 6, 6, 2},

{3, 8, 24, 8, 3},

{4, 15, 40, 40, 15, 4},

{5, 24, 90, 80, 90, 24, 5},

{7, 35, 168, 210, 210, 168, 35, 7},

{9, 56, 280, 448, 630, 448, 280, 56, 9},

{12, 81, 504, 840, 1512, 1512, 840, 504, 81, 12},

{16, 120, 810, 1680, 3150, 4032, 3150, 1680, 810, 120, 16}

MATHEMATICA

Clear[t, a, n, m] a[0] = 1; a[1] = 1; a[2] = 1; a[n_] := a[n] = a[n - 2] + a[n - 3]; t[n_, m_] := a[(n - m + 1)]*a[(m + 1)]*Binomial[n, m]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}] Flatten[%]

CROSSREFS

Cf. A141611, A141617, A000931.

KEYWORD

nonn,tabl,new

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Aug 24 2008

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research