A306899 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A306899

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

6, 12, 36, 48, 90, 180, 294, 576, 1134, 2160, 4158, 8496, 16458, 33096, 65880, 131712, 262242, 525852, 1048686, 2099520, 4195296, 8392824, 16777350, 33564672, 67109250, 134234256, 268438860, 536904480, 1073741994, 2147556240, 4294967478, 8590066944

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Michael De Vlieger, Table of n, a(n) for n = 1..3320

Dennis S. Bernstein, Omran Kouba, Counting Colorful Necklaces and Bracelets in Three Colors, arXiv:1901.10703 [math.CO], 2019.

MAPLE

See A306888.

MATHEMATICA

Table[DivisorSum[n, (2^# - (-1)^#) EulerPhi[3 n/#] &], {n, 10^4}] (* Michael De Vlieger, Mar 18 2019 *)

PROG

(PARI) a(n) = sumdiv(n, d, (2^d - (-1)^d)*eulerphi(3*n/d)); \\ Michel Marcus, Mar 16 2019