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 A338455 #7 Oct 30 2020 17:44:19
%S A338455 1307029927,2116078861,2665774183,2809370965,4108623302,4493733751,
%T A338455 5333670902,5497285284,5679049670,8209799382,9665369455,9708528486,
%U A338455 10353426151,10606564910,12777118615,12795699493,13660293367,13847206214,14351020663,15735895813,17912257013
%N A338455 Starts of runs of 5 consecutive numbers with the same total binary weight of their divisors (A093653).
%C A338455 Numbers k such that A093653(k) = A093653(k+1) = A093653(k+2) = A093653(k+3) = A093653(k+4).
%C A338455 Can 6 consecutive numbers have the same total binary weight of their divisors? If they exist, then they are larger than 10^11.
%e A338455 1307029927 is a term since A093653(1307029927) = A093653(1307029928) = A093653(1307029929) = A093653(1307029930) = A093653(1307029931) = 72.
%t A338455 f[n_] := DivisorSum[n, DigitCount[#, 2, 1] &]; s = {}; m = 5; fs = f /@ Range[m]; Do[If[Equal @@ fs, AppendTo[s, n - m]]; fs = Rest @ AppendTo[fs, f[n]], {n, m + 1, 10^7}]; s
%Y A338455 Cf. A093653.
%Y A338455 Subsequence of A338452, A338453 and A338454.
%Y A338455 Similar sequences: A045933, A045941, A049051.
%K A338455 nonn,base
%O A338455 1,1
%A A338455 _Amiram Eldar_, Oct 28 2020