cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 20 2021

Keywords

Crossrefs

Programs

  • 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
  • PARI
    a(n) = my(r=sqrt(n)); sumdiv(n, d, if ((d%2) && (dMichel Marcus, Aug 21 2021

Formula

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