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

%I #9 Aug 21 2021 13:08:47

%S 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,

%T 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,

%U 1,35,1,1,59,1,26,10,1,1,10,75,1,10,1,1,35,1,50,10,1,26

%N Sum of squares of odd divisors of n that are < sqrt(n).

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

%t Table[DivisorSum[n, #^2 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 80}]

%t 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

%o (PARI) a(n) = my(r=sqrt(n)); sumdiv(n, d, if ((d%2) && (d<r), d^2)); \\ _Michel Marcus_, Aug 21 2021

%Y Cf. A001157, A050999, A333805, A333807, A339353, A347162.

%K nonn

%O 1,12

%A _Ilya Gutkovskiy_, Aug 20 2021

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.)