OFFSET
1,1
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..200
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Vol. 226-228 (1995), 57-72.
Petros Hadjicostas, Proof of an explicit formula for Bower's CycleBG transform.
FORMULA
CycleBG transform of (6, 0, 0, 0, ...)
CycleBG transform T(A) = invMOEBIUS(invEULER(Carlitz(A)) + A(x^2) - A) + A.
Carlitz transform T(A(x)) has g.f. 1/(1-Sum_{k>0}(-1)^(k+1)*A(x^k)).
General formula for the CycleBG transform: T(A)(x) = A(x) - Sum_{k>=0} A(x^{2k+1}) + Sum_{k>=1} (phi(k)/k)*log(Carlitz(A)(x^k)). For a proof, see the links. (For this sequence, A(x) = 6*x.) - Petros Hadjicostas, Sep 16 2017
a(n) = (1/n) * Sum_{d | n} totient(n/d) * (5*(-1)^d + 5^d) for n > 1. - Andrew Howroyd, Mar 12 2017
G.f.: m*x - Sum_{k>=1} (phi(k)/k)*((m-1)*B(x^k)+C(x^k)) = m*x - (m-1)*x/(1-x^2) - Sum_{k>=1} (phi(k)/k)*C(x^k), where B(x) = log(1+x) and C(x) = log(1-(m-1)*x). Here m=6 is the number of colors. - Petros Hadjicostas, Sep 16 2017
MATHEMATICA
a[1] = 6;
a[n_] := (1/n) Sum[EulerPhi[n/d]*(5*(-1)^d + 5^d), {d, Divisors[n]}];
Array[a, 30] (* Jean-François Alcover, Jul 02 2018, after Andrew Howroyd *)
PROG
(PARI) a(n) = if(n==1, 6, sumdiv(n, d, eulerphi(n/d)*(5*(-1)^d + 5^d))/n); \\ Andrew Howroyd, Oct 14 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Christian G. Bower, Apr 29 2005
STATUS
approved