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.

This page as a plain text file.
%I A070310 #18 Dec 15 2017 17:35:53
%S A070310 28,652,10828
%N A070310 Numbers n such that the sum of its aliquot parts and the number of its divisors are both perfect numbers.
%C A070310 Subsequence of A237286. - _Roderick MacPhee_, Jan 19 2017
%t A070310 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}]
%o A070310 (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,","))))}
%Y A070310 Cf. A000396, A001065, A000005.
%K A070310 more,nonn,bref
%O A070310 1,1
%A A070310 _Jason Earls_, May 10 2002
%E A070310 Edited by _Robert G. Wilson v_, May 14 2002
%E A070310 No further terms below 10^8. Is the sequence complete? - _Klaus Brockhaus_, May 17 2002