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.

A380584 Number of positive integers <= n that have the same sum of odd divisors as n.

Original entry on oeis.org

1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 2, 4, 1, 2, 1, 3, 1, 3, 2, 6, 1, 2, 2, 3, 1, 2, 1, 4, 1, 3, 1, 3, 1, 4, 3, 5, 1, 2, 1, 3, 1, 2, 2, 4, 1, 2, 1, 5, 1, 4, 1, 7, 1, 4, 1, 3, 1, 5, 3, 4, 1, 2, 1, 3, 2, 2, 2, 5, 1, 2, 2, 5, 1, 2, 1, 4, 1, 2, 1, 6, 1, 6, 2, 6, 1, 2, 1, 3
Offset: 1

Views

Author

Ilya Gutkovskiy, Jan 30 2025

Keywords

Comments

Ordinal transform of A000593.

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[Range[n], Sum[Mod[d, 2] d, {d, Divisors[#]}] == Sum[Mod[d, 2] d, {d, Divisors[n]}] &]], {n, 1, 100}]

Formula

a(n) = |{j <= n : A000593(j) = A000593(n)}|.