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.

A291176 Numbers k such that s(k) = s(k-1) + s(k-2), where s(k) is the sum of proper divisors of k (A001065).

Original entry on oeis.org

3, 8, 20, 146139, 584835, 44814015, 1436395095, 9988999095, 25997557299, 193861767939, 2105722150095, 3921293253003, 8234992646643
Offset: 1

Views

Author

Amiram Eldar, Aug 19 2017

Keywords

Comments

a(14) > 10^13. - Giovanni Resta, Feb 25 2020

Examples

			s(146139) = 76581 = 75802 + 779 = s(146138) + s(146137), therefore 146139 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    s[n_]:=DivisorSigma[1,n]-n; Select[Range[10^6], s[#]==s[#-1]+s[#-2] &]

Extensions

a(7)-a(10) from Giovanni Resta, Aug 29 2017
a(11)-a(13) from Giovanni Resta, Feb 25 2020