Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144447
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144447 Four term recursive triangular sequence: A(n,k)= A(n - 1, k - 1) + A(n - 1, k) + A(n - 2, k - 1) + A(n, k - 1). +0
1
1, 1, 1, 1, 4, 1, 1, 7, 13, 1, 1, 10, 34, 49, 1, 1, 13, 64, 160, 211, 1, 1, 16, 103, 361, 781, 994, 1, 1, 19, 151, 679, 1981, 3967, 4963, 1, 1, 22, 208, 1141, 4162, 10891, 20815, 25780, 1, 1, 25, 274, 1774, 7756, 24790, 60463, 112021, 137803, 1 (list; graph; listen)
OFFSET

1,5

COMMENT

Row sums are:{1, 2, 6, 22, 95, 450, 2257, 11762, 63021, 344908}.

FORMULA

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

EXAMPLE

{1},

{1, 1},

{1, 4, 1},

{1, 7, 13, 1},

{1, 10, 34, 49, 1},

{1, 13, 64, 160, 211, 1},

{1, 16, 103, 361, 781, 994, 1},

{1, 19, 151, 679, 1981, 3967, 4963, 1},

{1, 22, 208, 1141, 4162, 10891, 20815, 25780, 1},

{1, 25, 274, 1774, 7756, 24790, 60463, 112021, 137803, 1}

MATHEMATICA

Clear[A, n, k] A[n_, 1] := 1; A[n_, n_] := 1; A[n_, k_] := A[n - 1, k - 1] + A[n - 1, k] + A[n - 2, k - 1] + A[n, k - 1]; a = Table[A[n, k], {n, 10}, {k, n}]; Flatten[a]

CROSSREFS

Sequence in context: A146771 A073697 A119673 this_sequence A051455 A158687 A141541

Adjacent sequences: A144444 A144445 A144446 this_sequence A144448 A144449 A144450

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Oct 05 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 December 20 13:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research