|
Search: id:A141671
|
|
|
| A141671 |
|
A triangle of coefficients as a modular shifted triangular sequence: t(n,m)=If[m == 0, n + 1, If[Mod[n, m] == 0, n/m, 0]]. |
|
+0
2
|
|
| 1, 2, 1, 3, 2, 1, 4, 3, 0, 1, 5, 4, 2, 0, 1, 6, 5, 0, 0, 0, 1, 7, 6, 3, 2, 0, 0, 1, 8, 7, 0, 0, 0, 0, 0, 1, 9, 8, 4, 0, 2, 0, 0, 0, 1, 10, 9, 0, 3, 0, 0, 0, 0, 0, 1, 11, 10, 5, 0, 0, 2, 0, 0, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Row sums are:
{1, 3, 6, 8, 12, 12, 19, 16, 24, 23, 29}.
This resulted from trying to get Mathematica code for one of Gary Adamson's triangular sequences and email from Mats Granvik.
|
|
FORMULA
|
t(n,m)=If[m == 0, n + 1, If[Mod[n, m] == 0, n/m, 0]].
|
|
EXAMPLE
|
{1},
{2, 1},
{3, 2, 1},
{4, 3, 0, 1},
{5, 4, 2, 0, 1},
{6, 5, 0, 0, 0, 1},
{7, 6, 3, 2, 0, 0, 1},
{8, 7, 0, 0, 0, 0, 0, 1},
{9, 8, 4, 0, 2, 0, 0, 0, 1},
{10, 9, 0, 3, 0, 0, 0, 0, 0, 1},
{11, 10, 5, 0, 0, 2, 0, 0, 0, 0, 1}
|
|
MATHEMATICA
|
t[n_, m_] = If[m == 0, n + 1, If[Mod[n, m] == 0, n/m, 0]]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]
|
|
PROGRAM
|
(PARI) t(m, n)={if(m, if(n%m, 0, n/m), n+1)}; for(n=0, 10, for(m=0, n, print1(t(m, n)", ")))
|
|
CROSSREFS
|
Apparently this is different from A141672. - N. J. A. Sloane (njas(AT)research.att.com), Sep 13 2008
Sequence in context: A120885 A057058 A141672 this_sequence A088643 A102482 A004736
Adjacent sequences: A141668 A141669 A141670 this_sequence A141672 A141673 A141674
|
|
KEYWORD
|
nonn,easy,tabl
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson and Mats Granvik (rlbagulatftn(AT)yahoo.com), Sep 06 2008
|
|
EXTENSIONS
|
Pari program from Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 11 2009
|
|
|
Search completed in 0.002 seconds
|
