Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154227
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154227 A recursive triangular sequence: A(n,k)= A(n - 1, k - 1) + A(n - 1, k) + n*(n + 1)*A(n - 2, k - 1)/2. +0
1
1, 1, 1, 1, 8, 1, 1, 19, 19, 1, 1, 35, 158, 35, 1, 1, 57, 592, 592, 57, 1, 1, 86, 1629, 5608, 1629, 86, 1, 1, 123, 3767, 28549, 28549, 3767, 123, 1, 1, 169, 7760, 105621, 309458, 105621, 7760, 169, 1, 1, 225, 14694, 320566, 1985274, 1985274, 320566, 14694, 225 (list; table; graph; listen)
OFFSET

0,5

COMMENT

Row sums are:

{1, 2, 10, 40, 230, 1300, 9040, 64880, 536560, 4641520,...}.

FORMULA

A(n,k)= A(n - 1, k - 1) + A(n - 1, k) + n*(n + 1)*A(n - 2, k - 1)/2.

EXAMPLE

{1},

{1, 1},

{1, 8, 1},

{1, 19, 19, 1},

{1, 35, 158, 35, 1},

{1, 57, 592, 592, 57, 1},

{1, 86, 1629, 5608, 1629, 86, 1},

{1, 123, 3767, 28549, 28549, 3767, 123, 1},

{1, 169, 7760, 105621, 309458, 105621, 7760, 169, 1},

{1, 225, 14694, 320566, 1985274, 1985274, 320566, 14694, 225, 1}

MATHEMATICA

A[n_, 1] := 1; A[n_, n_] := 1;

A[n_, k_] := A[n - 1, k - 1] + A[n - 1, k] + n*(n + 1)*A[n - 2, k - 1]/2;

Table[Table[A[n, m], {m, 1, n}], {n, 1, 10}];

Flatten[%]

CROSSREFS

Sequence in context: A051425 A051469 A155494 this_sequence A166340 A157178 A144436

Adjacent sequences: A154224 A154225 A154226 this_sequence A154228 A154229 A154230

KEYWORD

nonn,tabl,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 05 2009

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research