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.

A070310 Numbers n such that the sum of its aliquot parts and the number of its divisors are both perfect numbers.

Original entry on oeis.org

28, 652, 10828
Offset: 1

Views

Author

Jason Earls, May 10 2002

Keywords

Comments

Subsequence of A237286. - Roderick MacPhee, Jan 19 2017

Crossrefs

Programs

  • Mathematica
    p = {6, 28, 496, 8128, 33550336}; Do[a = Divisors[n]; If[ Position[p, Plus @@ Drop[a, -1]] != {} && Position[p, Length[a]] != {}, Print[n]], {n, 1, 10^7}]
  • PARI
    {for(n=1,10^8,d=numdiv(n); if(d==sigma(d)-d,s=sigma(n)-n; if(s==sigma(s)-s,print1(n,","))))}

Extensions

Edited by Robert G. Wilson v, May 14 2002
No further terms below 10^8. Is the sequence complete? - Klaus Brockhaus, May 17 2002