|
| |
|
|
A069094
|
|
Jordan function J_9(n).
|
|
6
| |
|
|
1, 511, 19682, 261632, 1953124, 10057502, 40353606, 133955584, 387400806, 998046364, 2357947690, 5149441024, 10604499372, 20620692666, 38441386568, 68585259008, 118587876496, 197961811866, 322687697778, 510999738368
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.
|
|
|
FORMULA
| a(n)=sum(d|n, d^9*mu(n/d))
Multiplicative with a(p^e) = p^(9e)-p^(9(e-1)).
|
|
|
MATHEMATICA
| JordanJ[n_, k_] := DivisorSum[n, #^k*MoebiusMu[n/#] &]; f[n_] := JordanJ[n, 9]; Array[f, 22]
|
|
|
PROG
| (PARI) for(n=1, 100, print1(sumdiv(n, d, d^9*moebius(n/d)), ", "))
|
|
|
CROSSREFS
| Cf. A059379 and A059380 (triangle of values of J_k(n)), A000010 (J_1), A059376 (J_3), A059377 (J_4), A059378 (J_5).
Sequence in context: A075944 A181128 A022525 * A024007 A160956 A022191
Adjacent sequences: A069091 A069092 A069093 * A069095 A069096 A069097
|
|
|
KEYWORD
| easy,nonn,mult
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 05 2002
|
| |
|
|
