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 A281007 #30 Feb 15 2017 09:39:38
%S A281007 1,1,1,2,1,1,2,2,1,1,2,2,1,2,2,1,2,1,2,2,2,2,1,1,2,2,2,2,1,2,2,3,2,2,
%T A281007 1,2,2,2,2,2,1,2,1,2,2,2,2,2,4,1,2,1,2,2,2,2,2,3,2,2,2,2,2,1,2,2,1,2,
%U A281007 2,4,2,2,2,2,2,1,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,4,1,2,4,2,1,2,2,2,2,2,2,2,2
%N A281007 Number of middle divisors of the n-th number that has middle divisors.
%C A281007 Conjecture 1: also widths of the successive terraces that we can find descending by the main diagonal of the pyramid described in A245092. Hence, bisection of A281012.
%C A281007 Conjecture 2: also number of central subparts in the symmetric representation of sigma of the numbers j that have the property that the number of parts in the symmetric representation of sigma(j) is odd.
%C A281007 Conjecture 3: Partial sums give A282131.
%F A281007 a(n) = A067742(A071562(n)).
%t A281007 DeleteCases[#, 0] &@ Table[Count[Divisors@ n, d_ /; Sqrt[n/2] <= d < Sqrt[2 n]], {n, 300}] (* _Michael De Vlieger_, Feb 12 2017 *)
%Y A281007 Positive terms in A067742.
%Y A281007 Cf. A071562, A196020, A235791, A236104, A237048, A237270, A237271, A237591, A237593, A240542, A244050, A244367, A244580, A245092, A262626, A279387, A280919, A281012, A282131.
%K A281007 nonn
%O A281007 1,4
%A A281007 _Omar E. Pol_, Feb 11 2017