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 A304463 #34 Aug 23 2018 17:29:16
%S A304463 1,2,2,2,91,6850,6850,10281,108771,171890,3760204,3760204,727940626,
%T A304463 5704384304,13264434091,13264434091,63719307522,287480681209,
%U A304463 607635436331
%N A304463 a(n) begins the first run of at least n consecutive numbers with the same number of bi-unitary divisors.
%C A304463 The bi-unitary version of A006558.
%C A304463 a(20) > 5*10^12. - _Giovanni Resta_, Aug 23 2018
%e A304463 a(5) = 91 since the number of bi-unitary divisors of 91, 92, 93, 94 and 95 is 4, and this is the first run of 5 consecutive numbers.
%t A304463 bdivnum[1] = 1; bdivnum[n_] := Times @@ ((# + Mod[#, 2]) & /@ Last /@ FactorInteger[n]); Seq[n_, q_] := Map[bdivnum, Range[n, n + q - 1]]; findConsec[q_, nmin_, nmax_] := Module[{}, s = Seq[1, q]; n = q + 1; found = False; Do[If[CountDistinct[s] == 1, found = True; Break[]]; s = Rest[AppendTo[s, bdivnum[n]]]; n++, {k, nmin, nmax}]; If[found, n - q, 0]]; seq = {1}; nmax = 100000000; Do[n1 = Last[seq]; s1 = findConsec[m, n1, nmax]; If[s1 == 0, Break[]]; AppendTo[seq, s1], {m, 2, 13}];
%Y A304463 Cf. A006558, A045983 (equivalent for unitary divisors), A286324.
%K A304463 nonn,more
%O A304463 1,2
%A A304463 _Amiram Eldar_, Aug 20 2018
%E A304463 a(14)-a(19) from _Giovanni Resta_, Aug 23 2018