The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A103636 Sum[d|n, d==0 mod 3, d^2]. 1
 0, 0, 9, 0, 0, 45, 0, 0, 90, 0, 0, 189, 0, 0, 234, 0, 0, 450, 0, 0, 450, 0, 0, 765, 0, 0, 819, 0, 0, 1170, 0, 0, 1098, 0, 0, 1890, 0, 0, 1530, 0, 0, 2250, 0, 0, 2340, 0, 0, 3069, 0, 0, 2610, 0, 0, 4095, 0, 0, 3258, 0, 0, 4914, 0, 0, 4500, 0, 0, 5490, 0, 0, 4770, 0, 0, 7650 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Robert Israel, Table of n, a(n) for n = 1..9999 FORMULA a(3*k) = 9*A001157(k), a(3*k+1)=a(3*k+2)=0. - Robert Israel, Jan 11 2018 MAPLE seq(op([0, 0, 9*numtheory:-sigma[2](k)]), k=1..50); # Robert Israel, Jan 11 2018 MATHEMATICA Table[Total[Select[Divisors[n], Divisible[#, 3]&]^2], {n, 100}] (* Harvey P. Dale, May 07 2014 *) CROSSREFS Cf. A001157. Sequence in context: A005083 A050453 A255292 * A278006 A221804 A275107 Adjacent sequences:  A103633 A103634 A103635 * A103637 A103638 A103639 KEYWORD nonn AUTHOR Ralf Stephan, Feb 11 2005 STATUS approved

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

Last modified February 24 17:16 EST 2020. Contains 332209 sequences. (Running on oeis4.)