login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327625 Expansion of Sum_{k>=0} x^(3^k) / (1 - x^(3^k))^2. 1
1, 2, 4, 4, 5, 8, 7, 8, 13, 10, 11, 16, 13, 14, 20, 16, 17, 26, 19, 20, 28, 22, 23, 32, 25, 26, 40, 28, 29, 40, 31, 32, 44, 34, 35, 52, 37, 38, 52, 40, 41, 56, 43, 44, 65, 46, 47, 64, 49, 50, 68, 52, 53, 80, 55, 56, 76, 58, 59, 80, 61, 62, 91, 64, 65, 88, 67, 68, 92, 70 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Sum of divisors d of n such that n/d is power of 3.

Inverse Moebius transform of A195459.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..20000

FORMULA

G.f. A(x) satisfies: A(x) = A(x^3) + x/(1 - x)^2.

G.f.: Sum_{k>=1} phi(3*k) * x^k / (2 * (1 - x^k)), where phi = A000010.

a(n) = (1/2) * Sum_{d|n} phi(3*d).

MATHEMATICA

nmax = 70; CoefficientList[Series[Sum[x^(3^k)/(1 - x^(3^k))^2, {k, 0, Floor[Log[3, nmax]] + 1}], {x, 0, nmax}], x] // Rest

a[n_] := DivisorSum[n, # &, IntegerQ[Log[3, n/#]] &]; Table[a[n], {n, 1, 70}]

a[n_] := 1/2 Sum[EulerPhi[3 d], {d, Divisors[n]}]; Table[a[n], {n, 1, 70}]

PROG

(PARI) A327625(n) = (n+sumdiv(n, d, my(b=0); if(isprimepower(n/d, &b)&&(3==b), d, 0))); \\ Antti Karttunen, Sep 19 2019

(MAGMA) [(1/2)*&+[EulerPhi(3*d) :d in Divisors(n)]:n in [1..70]]; // Marius A. Burtea, Sep 19 2019

CROSSREFS

Cf. A000010, A000244, A001651 (fixed points), A051064, A129527, A195459.

Sequence in context: A132128 A280057 A257174 * A084824 A344710 A184615

Adjacent sequences:  A327622 A327623 A327624 * A327626 A327627 A327628

KEYWORD

nonn,mult

AUTHOR

Ilya Gutkovskiy, Sep 19 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 15 00:08 EDT 2022. Contains 356122 sequences. (Running on oeis4.)