|
Search: id:A124976
|
|
|
| A124976 |
|
Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (sum{k=1 to m-1} t(k,n)) * (sum{k=1 to n-1} t(m,k)). |
|
+0
3
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 4, 9, 4, 1, 1, 8, 60, 60, 8, 1, 1, 16, 648, 4225, 648, 16, 1, 1, 32, 12240, 2818530, 2818530, 12240, 32, 1, 1, 64, 427680, 34599304740, 7947815340969, 34599304740, 427680, 64, 1, 1, 128, 28641600, 14799779785070280
(list; table; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
EXAMPLE
|
t(3,4) = (t(1,4)+t(2,4)) * (t(3,1)+t(3,2)+t(3,3)) = (1+4) * (1+2+9) = 60.
|
|
MATHEMATICA
|
t[m_, n_] := t[m, n] = If[m == 1 || n == 1, 1, Sum[t[k, n], {k, m - 1}] * Sum[t[m, j], {j, n - 1}]]; Flatten@Table[t[d + 1 - j, j], {d, 10}, {j, d}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A124975.
Sequence in context: A133135 A132311 A121697 this_sequence A113021 A064552 A123585
Adjacent sequences: A124973 A124974 A124975 this_sequence A124977 A124978 A124979
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Nov 14 2006
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 19 2006
|
|
|
Search completed in 0.003 seconds
|
