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.

A332036 Number of integers whose bi-unitary 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, 0, 2, 0, 2, 0, 0, 0, 3, 0, 1, 1, 0, 0, 3, 0, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 0, 0, 3, 0, 2, 0, 0, 0, 2, 0, 1, 0, 0, 0, 5, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 5, 0, 1, 0, 0, 0, 1, 0, 3, 0, 0, 0, 2, 0, 0, 0
Offset: 1

Views

Author

Amiram Eldar, Feb 05 2020

Keywords

Examples

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

Crossrefs

Programs

  • Mathematica
    fun[p_, e_] := If[OddQ[e], (p^(e + 1) - 1)/(p - 1), (p^(e + 1) - 1)/(p - 1) - p^(e/2)]; bsigma[1] = 1; bsigma[n_] := Times @@ (fun @@@ FactorInteger[n]); m = 100; v = Table[0, {m}]; Do[b = bsigma[k]; If[b <= m, v[[b]]++], {k, 1, m}]; v