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.

A332038 Number of integers whose infinitary divisors sum to n.

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 2, 0, 1, 1, 0, 1, 2, 0, 2, 0, 0, 0, 3, 0, 1, 0, 0, 0, 3, 0, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 0, 0, 3, 0, 2, 1, 0, 0, 2, 0, 1, 0, 0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 2, 0, 1, 0, 5, 0, 1, 0, 0, 0, 1, 0, 3, 0, 1, 0, 2, 1, 0, 0
Offset: 1

Views

Author

Amiram Eldar, Feb 05 2020

Keywords

Examples

			a(12) = 2 since there are 2 solutions to isigma(x) = 12 (isigma is A049417): 6 and 11.
		

Crossrefs

Programs

  • Mathematica
    fun[p_, e_] := Module[{b = IntegerDigits[e, 2], m}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := Times @@ (fun @@@ FactorInteger[n]); m = 100; v = Table[0, {m}]; Do[i = isigma[k]; If[i <= m, v[[i]]++], {k, 1, m}]; v