OFFSET
1,3
COMMENTS
The absolute values are Pazderski's multiplicative psi(n). - R. J. Mathar, Apr 03 2012
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..8191
M. Baake and N. Neumaerker, A note on the relation between fixed point and orbit count sequences, Journal of Integer Sequences (2009) 09.4.4.
G. Pazderski, Die Ordnungen, zu denen nur Gruppen mit gegebener Eigenschaft gehoren, Archiv math. 10 (1) (1959) 331.
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, Journal of Integer Sequences, 4 (2001), article 01.2.1.
FORMULA
For n with prime factorization n = p_1^{r_1}*...*p_s^{r_s} the n-th term is a(n) = Product_{k=1..s} Product_{j=1..r_k} (1 - p_k^j).
G.f.: The Dirichlet series for 1/a(n) is Product_{j>= 1} 1/zeta(s+j) = Product_{p prime} Product_{j>= 1} (1 - 1/p^(s+j)) where zeta(s) is Riemann's zeta function.
MAPLE
A153038 := proc(n)
local f, a, p, e;
if n = 1 then
1;
else
a := 1 ;
for f in ifactors(n)[2] do
p := op(1, f) ;
e := op(2, f) ;
a := a*mul(1-p^s, s=1..e) ;
end do:
return a ;
end if;
end proc: # R. J. Mathar, Apr 03 2012
MATHEMATICA
a[1] = 1; a[n_] := (x = 1; Do[p = f[[1]]; e = f[[2]]; x = x*Product[1 - p^s, {s, 1, e}], {f, FactorInteger[n]}]; x); Table[a[n], {n, 1, 46}] (* Jean-François Alcover, May 15 2012, after R. J. Mathar *)
PROG
(PARI) a(n)=my(f=factor(n)); prod(k=1, #f[, 1], prod(j=1, f[k, 2], 1-f[k, 1]^j)) \\ Charles R Greathouse IV, Sep 18 2012
CROSSREFS
KEYWORD
easy,eigen,frac,mult,sign
AUTHOR
Natascha Neumaerker (naneumae(AT)math.uni-bielefeld.de), Dec 17 2008
EXTENSIONS
More terms from Antti Karttunen, Oct 09 2018
STATUS
approved