login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063476 Sum_{d |C(n)} d^2, where C(n) is the Cototient function n - phi(n) (A051953). 1
0, 1, 1, 5, 1, 21, 1, 21, 10, 50, 1, 85, 1, 85, 50, 85, 1, 210, 1, 210, 91, 210, 1, 341, 26, 250, 91, 341, 1, 610, 1, 341, 170, 455, 122, 850, 1, 546, 260, 850, 1, 1300, 1, 850, 500, 850, 1, 1365, 50, 1300, 362, 1050, 1, 1911, 260, 1365, 500, 1300, 1, 2562, 1, 1365 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROG

(PARI) C(n)=n-eulerphi(n); j=[]; for(n=1, 200, j=concat(j, sumdiv(C(n), d, d^2))); j

(PARI) { for (n=1, 1000, if (n>1, a=sumdiv(n-eulerphi(n), d, d^2), a=0); write("b063476.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 22 2009]

CROSSREFS

Cf. A051953.

Sequence in context: A049411 A070729 A101693 * A126325 A095368 A029757

Adjacent sequences:  A063473 A063474 A063475 * A063477 A063478 A063479

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 27 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:04 EST 2012. Contains 205969 sequences.