|
Search: id:A069091
|
|
|
| A069091 |
|
Jordan function J_6(n). |
|
+0
1
|
|
| 1, 63, 728, 4032, 15624, 45864, 117648, 258048, 530712, 984312, 1771560, 2935296, 4826808, 7411824, 11374272, 16515072, 24137568, 33434856, 47045880, 62995968, 85647744, 111608280, 148035888, 187858944, 244125000, 304088904, 386889048
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.
|
|
FORMULA
|
a(n)=sum(d|n, d^6*mu(n/d))
Multiplicative with a(p^e) = p^(6e)-p^(6(e-1)).
|
|
PROGRAM
|
(PARI) for(n=1, 100, print1(sumdiv(n, d, d^6*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: A152725 A086578 A115152 this_sequence A123866 A024004 A091027
Adjacent sequences: A069088 A069089 A069090 this_sequence A069092 A069093 A069094
|
|
KEYWORD
|
easy,nonn,mult
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 05 2002
|
|
|
Search completed in 0.002 seconds
|
