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.
%I A306985 #12 Jul 21 2021 00:43:00
%S A306985 14,27,44,459,620,957,1334,1634,1652,2204,2685,3195,3451,3956,4064,
%T A306985 4544,5547,8495,8636,8907,9844,11515,15296,19491,20145,20155,27643,
%U A306985 31724,33998,38180,41265,41547,42818,45716,48364,61964,64665,74875,74918,79316,79826
%N A306985 Numbers k such that isigma(k) = isigma(k+1), where isigma(k) is the sum of the infinitary divisors of k (A049417).
%C A306985 a(n) differs from A293183(n) starting at n = 15.
%H A306985 Amiram Eldar, <a href="/A306985/b306985.txt">Table of n, a(n) for n = 1..1000</a>
%e A306985 14 is in the sequence since isigma(14) = isigma(15) = 24.
%t A306985 fun[p_,e_] := Module[{ b = IntegerDigits[e,2]}, m=Length[b]; Product[If[b[[j]]>0, 1+p^(2^(m-j)),1], {j,1,m}]]; isigma[1]=1; isigma[n_] := Times @@ fun @@@ FactorInteger[n]; aQ[n_] := isigma[n] == isigma[n+1]; Select[Range[1000], aQ]
%Y A306985 Cf. A002961, A049417, A064125, A293183.
%K A306985 nonn
%O A306985 1,1
%A A306985 _Amiram Eldar_, Mar 18 2019