The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A306898 a(n) = Sum_{d|n} 2^d*phi(2*n/d). 4
2, 8, 12, 32, 40, 96, 140, 320, 540, 1120, 2068, 4320, 8216, 16688, 32880, 66176, 131104, 263376, 524324, 1050880, 2097480, 4198480, 8388652, 16786368, 33554600, 67125344, 134218836, 268468928, 536870968, 1073809920, 2147483708, 4295099648, 8589938808, 17180131456, 34359739120, 68720011776 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Dennis S. Bernstein, Omran Kouba, Counting Colorful Necklaces and Bracelets in Three Colors, arXiv:1901.10703 [math.CO], 2019.
FORMULA
a(n) = 2 * n * A000013(n). - Seiichi Manyama, Jul 14 2023
MAPLE
See A306888.
MATHEMATICA
Table[DivisorSum[n, 2^# *EulerPhi[2 n/#] &], {n, 36}] (* Michael De Vlieger, Mar 18 2019 *)
PROG
(PARI) a(n) = sumdiv(n, d, 2^d*eulerphi(2*n/d)); \\ Michel Marcus, Mar 16 2019
CROSSREFS
Sequence in context: A047174 A048074 A126775 * A069185 A037197 A125712
KEYWORD
nonn
AUTHOR
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 May 13 15:50 EDT 2024. Contains 372521 sequences. (Running on oeis4.)