login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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 * A177113 A077184 A077183

Adjacent sequences:  A122493 A122494 A122495 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:39 EST 2012. Contains 205635 sequences.