|
| |
|
|
A126690
|
|
Multiplicative function defined for prime powers by a(p^k) = p + p^2 + p^3 + ... + p^(k-1) - 1 (k >= 1).
|
|
2
|
|
|
|
1, -1, -1, 1, -1, 1, -1, 5, 2, 1, -1, -1, -1, 1, 1, 13, -1, -2, -1, -1, 1, 1, -1, -5, 4, 1, 11, -1, -1, -1, -1, 29, 1, 1, 1, 2, -1, 1, 1, -5, -1, -1, -1, -1, -2, 1, -1, -13, 6, -4, 1, -1, -1, -11, 1, -5, 1, 1, -1, 1, -1, 1, -2, 61, 1, -1, -1, -1, 1, -1, -1, 10, -1, 1, -4, -1, 1, -1, -1, -13, 38, 1, -1, 1, 1, 1, 1, -5, -1, 2, 1, -1, 1, 1, 1, -29, -1, -6, -2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,8
|
|
|
COMMENTS
|
If we change the definition to a(p^k) = p + p^2 + p^3 + ... + p^k - 1 (k >= 1) we get (-1)sigma(n), A046090.
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
a(5) = -1, a(9) = 3-1 = 2, a(45) = (-1)*2 = -2.
|
|
|
MAPLE
|
pksum := proc(L) local p, k ; p := op(1, L) ; k := op(2, L) ; (p^k-p)/(p-1)-1 ; end: A126690 := proc(n) local pe, a ; if n = 1 then RETURN(1) ; else a := 1 ; pe := ifactors(n)[2] ; for d in pe do a := a*pksum(d) ; od: RETURN(a) ; fi; end: for n from 1 to 120 do printf("%d, ", A126690(n)) ; od: # R. J. Mathar, Aug 08 2008
|
|
|
MATHEMATICA
|
a[1] = 1;
a[n_] := a[n] = Product[{p, k} = pk; Total[p^Range[k - 1]] - 1, {pk, FactorInteger[n]}];
|
|
|
PROG
|
(Scheme, with memoization-macro definec)
;; Auxiliary function add implements sum_{i=lowlim..uplim} intfun(i)
(define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i)))))))
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
sign,mult
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
