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 A335399 #22 Jun 07 2020 18:40:23
%S A335399 146447622,2259799749,2559357269,2647718871,3660580374,4262858871,
%T A335399 4708102374,5188831623,5341658373,5494129749,5728055749,5876715750,
%U A335399 6127708374,6455588247,6608437623,6612840374,6617111750,6689113623,6722600373,7456747623,7923798375,8272111445
%N A335399 Starts of runs of 5 consecutive numbers that have an equal number of unitary and nonunitary divisors (A048109).
%C A335399 Do longer runs of consecutive numbers with an equal number of unitary and nonunitary divisors exist for any length of run?
%C A335399 Starts of runs of 6 consecutive numbers that have an equal number of unitary and nonunitary divisors, from _Giovanni Resta_'s bfile, 80566783622, 117243671750, 390773539750, 573122731621, 636972066374. - _Zak Seidov_, Jun 07 2020
%H A335399 Giovanni Resta, <a href="/A335399/b335399.txt">Table of n, a(n) for n = 1..3000</a>
%e A335399 146447622 is a term since 146447622, 146447623, 146447624, 146447625 and 146447626 each have an equal number of unitary and nonunitary divisors. 146447622 has 32 unitary divisors and 32 nonunitary divisors, 146447623, 146447625 and 146447626 each have 8 and 8, and 146447624 has 16 and 16.
%t A335399 q[n_] := DivisorSigma[0, n] == 2^(PrimeNu[n] + 1); v = q /@ Range[5]; seq = {}; Do[v = Append[Drop[v, 1], q[k]]; If[And @@ v, AppendTo[seq, k - 4]], {k, 6, 3*10^8}]; seq
%Y A335399 Subsequence of A048109, A335328, A335397 and A335398.
%Y A335399 Cf. A000005, A034444, A048105.
%K A335399 nonn
%O A335399 1,1
%A A335399 _Zak Seidov_ and _Amiram Eldar_, Jun 06 2020