|
Search: id:A141673
|
|
|
| A141673 |
|
Triangular sequence A126988 time the Moebius Mu function: t(n,m)=If[m == 1, n, If[Mod[n, m] == 0, MoebiusMu[n]*n/m, 0]]. |
|
+0
1
|
|
| 1, 2, -1, 3, 0, -1, 4, 0, 0, 0, 5, 0, 0, 0, -1, 6, 3, 2, 0, 0, 1, 7, 0, 0, 0, 0, 0, -1, 8, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 10, 5, 0, 0, 2, 0, 0, 0, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Row sums are:
{1, 1, 2, 4, 4, 12, 6, 8, 9, 18}.
The function here is Mats Granvik's idea: my effort is coding it and entering it in OEIS. All of it is based on Gary Adamson's inspired A126988.
|
|
FORMULA
|
t(n,m)=If[m == 1, n, If[Mod[n, m] == 0, MoebiusMu[n]*n/m, 0]].
|
|
EXAMPLE
|
{1},
{2, -1},
{3, 0, -1},
{4, 0, 0, 0},
{5, 0, 0, 0, -1},
{6, 3, 2, 0, 0, 1},
{7, 0, 0, 0, 0, 0, -1},
{8, 0, 0, 0, 0, 0, 0, 0},
{9, 0, 0, 0, 0, 0, 0, 0, 0},
{10, 5, 0, 0, 2, 0, 0, 0, 0, 1}
|
|
MATHEMATICA
|
t[n_, m_] = If[m == 1, n, If[Mod[n, m] == 0, MoebiusMu[n]*n/m, 0]]; Table[Table[t[n, m], {m, 1, n}], {n, 1, 10}]; Flatten[%]
|
|
CROSSREFS
|
Cf. A126988.
Sequence in context: A119709 A120251 A071490 this_sequence A127094 A158906 A143239
Adjacent sequences: A141670 A141671 A141672 this_sequence A141674 A141675 A141676
|
|
KEYWORD
|
uned,sign
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson and Mats Granvik (rlbagulatftn(AT)yahoo.com), Sep 06 2008
|
|
|
Search completed in 0.002 seconds
|
