|
Search: id:A069093
|
|
|
| A069093 |
|
Jordan function J_8(n). |
|
+0
1
|
|
| 1, 255, 6560, 65280, 390624, 1672800, 5764800, 16711680, 43040160, 99609120, 214358880, 428236800, 815730720, 1470024000, 2562493440, 4278190080, 6975757440, 10975240800, 16983563040, 25499934720, 37817088000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.
|
|
FORMULA
|
a(n)=sum(d|n, d^8*mu(n/d))
Multiplicative with a(p^e) = p^(8e)-p^(8(e-1)).
|
|
PROGRAM
|
(PARI) for(n=1, 100, print1(sumdiv(n, d, d^8*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: A075945 A075941 A022524 this_sequence A024006 A022190 A069383
Adjacent sequences: A069090 A069091 A069092 this_sequence A069094 A069095 A069096
|
|
KEYWORD
|
easy,nonn,mult
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 05 2002
|
|
|
Search completed in 0.002 seconds
|
