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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A347162 Sum of cubes of odd divisors of n that are < sqrt(n). 4
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 153, 1, 1, 28, 1, 126, 28, 1, 1, 28, 126, 1, 28, 1, 1, 153, 1, 1, 28, 1, 126, 28, 1, 1, 28, 126, 344, 28, 1, 1, 153, 1, 1, 371, 1, 126, 28, 1, 1, 28, 469, 1, 28, 1, 1, 153 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

FORMULA

G.f.: Sum_{k>=1} (2*k - 1)^3 * x^(2*k*(2*k - 1)) / (1 - x^(2*k - 1)).

MATHEMATICA

Table[DivisorSum[n, #^3 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 75}]

nmax = 75; CoefficientList[Series[Sum[(2 k - 1)^3 x^(2 k (2 k - 1))/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

scod[n_]:=Total[Select[Divisors[n], #<Sqrt[n]&&OddQ[#]&]^3]; Array[scod, 80] (* Harvey P. Dale, Jan 07 2022 *)

PROG

(PARI) a(n) = my(r=sqrt(n)); sumdiv(n, d, if ((d%2) && (d<r), d^3)); \\ Michel Marcus, Aug 21 2021

CROSSREFS

Cf. A001158, A051000, A333805, A333807, A339354, A347161.

Sequence in context: A040786 A040785 A040784 * A347174 A352031 A174188

Adjacent sequences: A347159 A347160 A347161 * A347163 A347164 A347165

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Aug 20 2021

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 December 3 23:05 EST 2022. Contains 358543 sequences. (Running on oeis4.)