|
Search: id:A127098
|
|
| |
|
| 1, 5, 2, 10, 0, 3, 21, 2, 8, 4, 26, 0, 0, 0, 5, 50, 2, 3, 18, 12, 6, 50, 0, 0, 0, 0, 0, 7, 85, 2, 8, 4, 32, 0, 16, 8, 91, 0, 3, 0, 0, 0, 27, 0, 9, 130, 2, 0, 0, 5, 50, 0, 0, 20, 10, 122, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 210, 2, 11, 22, 12, 6, 72, 0, 48, 36, 24, 12, 170, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 250, 2, 0, 0, 0, 0, 7, 98, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A127097 is a close companion.
|
|
FORMULA
|
T(n,m)=sum_{k=m..n} A127093(n,k)*A127094(k,m).
Row sums: sum_{m=1..n} T(n,m) = A001001(n).
Left column: T(1,m) = A001157(m).
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
5, 2;
10, 0, 3;
21, 2, 8, 4;
26, 0, 0, 0, 5;
50, 2, 3, 18, 12, 6;
50, 0, 0, 0, 0, 0, 7;
85, 2, 8, 4, 32, 0, 16, 8;
|
|
MAPLE
|
A127093 := proc(n, m) if m> n or m<1 or n < 1 then 0 ; elif (n mod m) = 0 then m; else 0 ; fi; end:
A127094 := proc(n, m) A127093(n, n-m+1) ; end: A127098 := proc(n, m) add( A127093(n, k)*A127094(k, m), k=1..n) ; end:
for n from 1 to 30 do for m from 1 to n do printf("%d, ", A127098(n, m)) ; od: od: # R. J. Mathar, Mar 02 2009
|
|
CROSSREFS
|
Cf. A127097, A127093, A127094, A001001, A001157.
Sequence in context: A065270 A065282 A080379 this_sequence A127097 A040024 A036121
Adjacent sequences: A127095 A127096 A127097 this_sequence A127099 A127100 A127101
|
|
KEYWORD
|
nonn,tabl,easy
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 05 2007
|
|
EXTENSIONS
|
Edited and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 02 2009
|
|
|
Search completed in 0.002 seconds
|
