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 A152983 #11 Nov 26 2019 04:18:34
%S A152983 1,1,2,3,3,4,4,2,4,4,6,8,2,8,24,18,4,16,8,12,16,24,48,72,12,8,6,16,8,
%T A152983 16,8,12,4,16,64,12,2,8,8,8,8,24,96,96,6,24,72,48,24,32,128,96,16,8,8,
%U A152983 8,16,128,60,192,6,32,32,96,8,96,512,36,24,16,24,384,24,96,144,48,64,64,32
%N A152983 Number of divisors of Motzkin number A001006(n).
%H A152983 Amiram Eldar, <a href="/A152983/b152983.txt">Table of n, a(n) for n = 0..200</a>
%F A152983 a(n) = A000005(A001006(n)).
%e A152983 a(5)=4 because the Motzkin number M(5)=21 has 4 divisors: 1,3,7 and 21. - _Emeric Deutsch_, Jan 14 2009
%p A152983 with(numtheory): M := proc (n) options operator, arrow: (sum((-1)^j*binomial(n+1, j)*binomial(2*n-3*j, n), j = 0 .. floor((1/3)*n)))/(n+1) end proc: seq(tau(M(n)), n = 0 .. 82); # _Emeric Deutsch_, Jan 14 2009
%t A152983 mot[0] = 1; mot[n_] := mot[n] = mot[n - 1] + Sum[mot[k] * mot[n - 2 - k], {k, 0, n - 2}]; Table[DivisorSigma[0, mot[n]], {n, 0, 50}] (* _Amiram Eldar_, Nov 26 2019 *)
%Y A152983 Cf. A000005, A001006, A152763.
%K A152983 nonn
%O A152983 0,3
%A A152983 _Omar E. Pol_, Dec 20 2008
%E A152983 Extended by _Emeric Deutsch_, Jan 14 2009