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.

A063734 Square abundant numbers.

This page as a plain text file.
%I A063734 #22 Mar 07 2025 03:00:27
%S A063734 36,100,144,196,324,400,576,784,900,1296,1600,1764,1936,2304,2500,
%T A063734 2704,2916,3136,3600,4356,4624,4900,5184,5776,6084,6400,7056,7744,
%U A063734 8100,8464,9216,9604,10000,10404,10816,11025,11664,12100,12544,12996,13456,14400
%N A063734 Square abundant numbers.
%H A063734 Amiram Eldar, <a href="/A063734/b063734.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)
%F A063734 a(n) = A381738(n)^2. - _Amiram Eldar_, Mar 07 2025
%t A063734 Select[Range[150]^2,DivisorSigma[1,#]>2#&] (* _Harvey P. Dale_, Aug 14 2014 *)
%o A063734 (PARI) j=[]; for(n=1,25000, if(sigma(n)>(2*n),a=n; if(issquare(a),j=concat(j,a)))); j
%o A063734 (PARI) { n=0; for (m=1, 10^9, if (issquare(m) && sigma(m)>(2*m), write("b063734.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 29 2009
%o A063734 (PARI) { n=0; for (m=1, 10^9, s=m^2; if (sigma(s)>(2*s), write("b063734.txt", n++, " ", s); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 29 2009
%Y A063734 Intersection of A000290 and A005101.
%Y A063734 Subsequence of A363169.
%Y A063734 Cf. A381738.
%K A063734 nonn
%O A063734 1,1
%A A063734 _Jason Earls_, Aug 13 2001