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.

A324367 Numbers k such that s(k) = s(k+1) where s(k) is the sum of divisors of k that are larger than sqrt(k) (A238535).

This page as a plain text file.
%I A324367 #22 Sep 06 2019 07:30:11
%S A324367 45,62,15795,355022,14257705,28856174,2324581982,103321586193
%N A324367 Numbers k such that s(k) = s(k+1) where s(k) is the sum of divisors of k that are larger than sqrt(k) (A238535).
%C A324367 a(9) > 2*10^11. - _Giovanni Resta_, Sep 06 2019
%e A324367 45 is in the sequence since A238535(45) = A238535(46) = 69.
%t A324367 s[n_] := DivisorSum[n, # &, # > Sqrt[n] &]; seq={}; s1 = 0; Do[s2 = s[n]; If[s1 == s2, AppendTo[seq, n - 1]]; s1 = s2, {n, 2, 10000}]; seq
%Y A324367 Cf. A002961, A064115, A064125, A164522, A164557, A238535, A293183, A306985, A324295.
%K A324367 nonn,more
%O A324367 1,1
%A A324367 _Amiram Eldar_, Sep 03 2019
%E A324367 a(8) from _Giovanni Resta_, Sep 06 2019