|
Search: id:A144431
|
|
|
| A144431 |
|
A sub-Pascal recursion triangle sequence: m=-1; A(n,k) := (m*n - m*k + 1)A(n - 1, k - 1) + (m*k - (m - 1))A(n - 1, k). |
|
+0
1
|
|
| 1, 1, 1, 1, 0, 1, 1, -1, -1, 1, 1, -2, 2, -2, 1, 1, -3, 2, 2, -3, 1, 1, -4, 7, -8, 7, -4, 1, 1, -5, 9, -5, -5, 9, -5, 1, 1, -6, 16, -26, 30, -26, 16, -6, 1, 1, -7, 20, -28, 14, 14, -28, 20, -7, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,12
|
|
|
COMMENT
|
Row sums are:{1, 2, 2, 0, 0, 0, 0, 0, 0, 0}.
m=0 is the Pascal sequence, so m=-1 is sub-Pascal.
The triangle starts off like A098593, but is different further on.
|
|
FORMULA
|
m=-1; A(n,k) := (m*n - m*k + 1)A(n - 1, k - 1) + (m*k - (m - 1))A(n - 1, k).
|
|
EXAMPLE
|
{1},
{1, 1},
{1, 0, 1},
{1, -1, -1, 1},
{1, -2, 2, -2, 1},
{1, -3, 2, 2, -3, 1},
{1, -4, 7, -8, 7, -4, 1},
{1, -5, 9, -5, -5, 9, -5, 1},
{1, -6, 16, -26, 30, -26, 16, -6, 1},
{1, -7, 20, -28, 14, 14, -28, 20, -7, 1
|
|
MATHEMATICA
|
m=-1; A[n_, 1] := 1; A[n_, n_] := 1; A[n_, k_] := (m*n - m*k + 1)A[n - 1, k - 1] + (m*k - (m - 1))A[n - 1, k]; a = Table[A[n, k], {n, 10}, {k, n}]; Flatten[a]
|
|
CROSSREFS
|
Cf. A098593.
Sequence in context: A051950 A104754 A098593 this_sequence A053821 A076545 A162246
Adjacent sequences: A144428 A144429 A144430 this_sequence A144432 A144433 A144434
|
|
KEYWORD
|
uned,sign
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 04 2008
|
|
|
Search completed in 0.002 seconds
|
