|
Search: id:A069092
|
|
|
| A069092 |
|
Jordan function J_7(n). |
|
+0
1
|
|
| 1, 127, 2186, 16256, 78124, 277622, 823542, 2080768, 4780782, 9921748, 19487170, 35535616, 62748516, 104589834, 170779064, 266338304, 410338672, 607159314, 893871738, 1269983744, 1800262812, 2474870590, 3404825446, 4548558848
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.
|
|
FORMULA
|
a(n)=sum(d|n, d^7*mu(n/d))
Multiplicative with a(p^e) = p^(7e)-p^(7(e-1)).
|
|
PROGRAM
|
(PARI) for(n=1, 100, print1(sumdiv(n, d, d^7*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: A075938 A022523 A090029 this_sequence A024005 A008398 A144969
Adjacent sequences: A069089 A069090 A069091 this_sequence A069093 A069094 A069095
|
|
KEYWORD
|
easy,nonn,mult
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 05 2002
|
|
|
Search completed in 0.002 seconds
|
