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!)
A347161 Sum of squares of odd divisors of n that are < sqrt(n). 3
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 35, 1, 1, 10, 1, 26, 10, 1, 1, 10, 26, 1, 10, 1, 1, 35, 1, 1, 10, 1, 26, 10, 1, 1, 10, 26, 50, 10, 1, 1, 35, 1, 1, 59, 1, 26, 10, 1, 1, 10, 75, 1, 10, 1, 1, 35, 1, 50, 10, 1, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,12
LINKS
FORMULA
G.f.: Sum_{k>=1} (2*k - 1)^2 * x^(2*k*(2*k - 1)) / (1 - x^(2*k - 1)).
MATHEMATICA
Table[DivisorSum[n, #^2 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 80}]
nmax = 80; CoefficientList[Series[Sum[(2 k - 1)^2 x^(2 k (2 k - 1))/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
PROG
(PARI) a(n) = my(r=sqrt(n)); sumdiv(n, d, if ((d%2) && (d<r), d^2)); \\ Michel Marcus, Aug 21 2021
CROSSREFS
Sequence in context: A010177 A096089 A010176 * A347173 A351647 A168644
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 August 26 07:40 EDT 2024. Contains 375454 sequences. (Running on oeis4.)