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 A264440 #22 May 23 2024 16:13:44
%S A264440 1,1,1,1,1,2,1,2,1,2,1,4,1,2,2,3,1,4,1,4,2,2,1,6,1,2,2,4,1,6,1,4,2,2,
%T A264440 2,7,1,2,2,6,1,6,1,4,4,2,1,8,1,4,2,4,1,6,2,6,2,2,1,10,1,2,4,5,2,6,1,4,
%U A264440 2,6,1,10,1,2,4,4,2,6,1,8,3,2,1,10,2,2
%N A264440 Row lengths of the irregular triangle A137510 (number of divisors d of n with 1 < d < n, or 0 if no such d exists).
%C A264440 See A032741 for the number of divisors d of n with 1 <= d < n, n >= 1.
%C A264440 See A070824 for the number of the divisors d of n with 1 < d < n, n >= 1.
%H A264440 Antti Karttunen, <a href="/A264440/b264440.txt">Table of n, a(n) for n = 1..10000</a>
%F A264440 a(1) = 1; a(n) = 1 if n is prime, otherwise a(n) = A070824(n).
%F A264440 a(1) = 1; a(n) = 1 if n is prime, otherwise a(n) = A032741(n) - 1.
%F A264440 a(n) = max(1, A000005(n)-2). - _Robert Israel_, Jan 20 2016
%p A264440 seq(max(1,numtheory:-tau(n)-2), n=1..100); # _Robert Israel_, Jan 20 2016
%t A264440 Array[DivisorSigma[0, #] - 2 &, {80}] /. n_ /; n < 2 -> 1 (* _Michael De Vlieger_, Jan 16 2016 *)
%o A264440 (PARI) A264440(n) = max(1,numdiv(n)-2); \\ After _Robert Israel_'s formula. - _Antti Karttunen_, May 25 2017
%Y A264440 Cf. A000005, A000040, A032741, A070824, A137510.
%K A264440 nonn,easy
%O A264440 1,6
%A A264440 _Wolfdieter Lang_, Jan 16 2016