|
Search: id:A122496
|
|
|
| A122496 |
|
Triangle read by rows: Definf f[i, k, l] = binomial[k - l, i - Min[k, l]]/2^(k - l). Then a(n,m) =f[n, 0, m] |
|
+0
1
|
|
| 1, 0, -2, 0, 2, 12, 0, -2, -16, -80, 0, 2, 20, 120, 560, 0, -2, -24, -168, -896, -4032, 0, 2, 28, 224, 1344, 6720, 29568, 0, -2, -32, -288, -1920, -10560, -50688, -219648, 0, 2, 36, 360, 2640, 15840, 82368, 384384, 1647360, 0, -2, -40, -440, -3520, -22880, -128128, -640640, -2928640, -12446720, 0, 2, 44
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Ulam combinatorial gene law as limited triangular array.
|
|
REFERENCES
|
S. M. Ulam, Problems in Modern Mathematics,John Wiley and Sons, New York,1960, page 87
|
|
EXAMPLE
|
1
0,-2
0, 2, 12
0, -2, -16, -80
0, 2, 20, 120, 560
0, -2, -24, -168, -896, -4032
|
|
MATHEMATICA
|
f[i_, k_, l_] = Binomial[k - l, i - Min[k, l]]/2^(k - l) a = Table[Table[f[i, 0, l], {l, 0, i}], {i, 0, 10}] Flatten[a]
|
|
CROSSREFS
|
Sequence in context: A096734 A038020 A107094 this_sequence A077184 A077183 A101030
Adjacent sequences: A122493 A122494 A122495 this_sequence A122497 A122498 A122499
|
|
KEYWORD
|
sign,tabl
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 14 2006
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 01 2006
|
|
|
Search completed in 0.002 seconds
|
