|
|
|
|
1, 3, 1, 6, 1, 1, 10, 1, 3, 1, 15, 1, 3, 1, 1, 21, 1, 3, 4, 3, 1, 28, 1, 3, 4, 3, 1, 1, 36, 1, 3, 4, 7, 1, 3, 1, 45, 1, 3, 4, 7, 1, 6, 1, 1, 55, 1, 3, 4, 7, 6, 6, 1, 3, 1, 66, 1, 3, 4, 7, 6, 6, 1, 3, 1, 1, 78, 1, 3, 4, 7, 6, 12, 1, 7, 4, 3, 1, 91, 1, 3, 4, 7, 6, 12, 1, 7, 4, 3, 1, 1, 105, 1, 3, 4, 7, 6, 12, 8, 7, 4, 3, 1, 3, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Consider A000012 as a lower-left all-1's triangle, and build the matrix product by multiplication with A127094 from the right.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
3, 1,
6, 1, 1;
10, 1, 3, 1;
15, 1, 3, 1, 1;
21, 1, 3, 4, 3, 1;
28, 1, 3, 4, 3, 1, 1;
...
|
|
MAPLE
|
A127093 := proc(n, m) if n mod m = 0 then m; else 0 ; fi; end:
for n from 1 to 15 do for m from 1 to n do printf("%d, ", A127096(n, m)) ; od: od: # R. J. Mathar, Aug 18 2009
|
|
MATHEMATICA
|
T[n_, m_] := Sum[1 + Mod[j, m - j - 1] - Mod[1 + j, m - j - 1], {j, m, n}];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|