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 A333801 #9 Apr 06 2020 02:20:32
%S A333801 2,3,4,7,8,16,20,31,35,127,143,208,256,650,1479,2464,2623,4233,4345,
%T A333801 5183,8099,8191,9424,11024,11919,12099,14905,16159,20220,20800,21716,
%U A333801 22194,24335,26123,27335,27390,30457,34945,38180,40425,52206,56563,65536,67123,68264
%N A333801 Numbers k such that A008475(k)+1 = A008475(k+1).
%C A333801 A variation of A064111 and A228126 with unitary prime-power divisors instead of prime divisors.
%H A333801 Amiram Eldar, <a href="/A333801/b333801.txt">Table of n, a(n) for n = 1..10000</a>
%e A333801 4 is a term since A008475(4) + 1 = 4 + 1 = 5 = A008475(5).
%t A333801 s[1] = 0; s[n_] := Plus @@ (Power @@@ FactorInteger[n]); seq = {}; s1 = 0; Do[s2 = s[n]; If[s1 + 1 == s2, AppendTo[seq, n - 1]]; s1 = s2, {n, 2, 10^5}]; seq
%Y A333801 Cf. A006145, A008475, A039752, A064111, A228126, A331000, A333802.
%K A333801 nonn
%O A333801 1,1
%A A333801 _Amiram Eldar_, Apr 05 2020