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.

Previous Showing 11-12 of 12 results.

A332974 Solutions k of the equation s(k) = s(k-1) + s(k-2) where s(k) = usigma(k) - k is the sum of proper unitary divisors of k (A063919).

Original entry on oeis.org

3, 21, 321, 1257, 3237, 146139, 268713, 584835, 26749089, 9988999095, 25997557299, 54449485353, 935628578283, 2105722150095, 3921293253003, 8234992646643
Offset: 1

Views

Author

Amiram Eldar, Mar 04 2020

Keywords

Comments

a(17) > 10^13. - Giovanni Resta, May 09 2020

Examples

			21 is a term since s(21) = 11 and s(19) + s(20) = 1 + 10 = 11.
		

Crossrefs

Programs

  • Mathematica
    usigma[1] = 1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); s[n_] := usigma[n] - n; Select[Range[3, 6*10^5], s[#] == s[# - 1] + s[# - 2] &]

Extensions

a(12)-a(16) from Giovanni Resta, May 09 2020

A332976 Solutions k of the equation s(k) = s(k-1) + s(k-2) where s(k) = isigma(k) - k is the sum of proper infinitary divisors of k (A126168).

Original entry on oeis.org

3, 8, 10, 21, 3237, 7377, 146139, 584835, 9988999095, 25997557299
Offset: 1

Views

Author

Amiram Eldar, Mar 04 2020

Keywords

Examples

			8 is a term since s(8) = 7 and s(6) + s(7) = 6 + 1 = 7.
		

Crossrefs

Programs

  • Mathematica
    fun[p_, e_] := Module[{b = IntegerDigits[e, 2]}, 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]; s[n_] := isigma[n] - n; Select[Range[3, 6*10^5], s[#] == s[# - 1] + s[# - 2] &]
Previous Showing 11-12 of 12 results.