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.

A325175 Numbers k such that s(k) = s(k+1) = s(k+2) = s(k+3) where s(k) is the sum of divisors of k that are smaller than sqrt(k) (A070039).

This page as a plain text file.
%I A325175 #26 Sep 05 2019 08:10:09
%S A325175 2,1190499411,7896840789,9190223334,10546199943,13239147654,
%T A325175 16488284454,19818736503,19927041063,20401914903,20551875063,
%U A325175 24219563814,25442242503,27391724583,34539825543,35714513463,37014168183,44120613543,44130940614,44514172134,48647900639
%N A325175 Numbers k such that s(k) = s(k+1) = s(k+2) = s(k+3) where s(k) is the sum of divisors of k that are smaller than sqrt(k) (A070039).
%C A325175 Five consecutive coincident values of A070039 are also possible. One such occurrence starts a 211301122224870.
%e A325175 2 is in the sequence since A070039(2) = A070039(3) = A070039(4) = A070039(5) = 1.
%Y A325175 Cf. A070039, A324295, A324310.
%K A325175 nonn
%O A325175 1,1
%A A325175 _Giovanni Resta_, Sep 05 2019