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 A258710 #18 Nov 05 2018 03:07:28 %S A258710 1,1,2,4,9,10,7,6,4,10,10,1,1,2,4,9,10,7,6,4,9,0,3,3,6,1,5,8,10,7,1,6, %T A258710 10,7,7,3,6,8,4,5,9,6,9,10,8,8,5,10,6,3,1,4,10,9,8,7,7,3,6,8,4,5,9,6, %U A258710 3,5,9,9,7,3,4,2,8,10,3,8,7,8,8,5,10,6,3,1,4,10 %N A258710 Motzkin numbers A001006 read mod 11. %H A258710 Rob Burns, <a href="https://arxiv.org/abs/1612.08146">Structure and asymptotics for Motzkin numbers modulo small primes using automata</a>, arXiv:1612.08146 [math.NT], 2016. %H A258710 Anders Hyllengren, <a href="/A258710/a258710.pdf">Letter to N. J. A. Sloane, Oct 04 1985</a> %t A258710 m[0] = 1; m[n_] := m[n] = m[n-1] + Sum[m[k] m[n-k-2], {k, 0, n-2}]; %t A258710 a[n_] := Mod[m[n], 11]; %t A258710 Array[a, 100, 0] (* _Jean-François Alcover_, Nov 05 2018 *) %Y A258710 Cf. A001006. %Y A258710 Motzkin numbers A001006 read mod 2,3,4,5,6,7,8,11: A039963, A039964, A299919, A258712, A299920, A258711, A299918, A258710. %K A258710 nonn %O A258710 0,3 %A A258710 _N. J. A. Sloane_, Jun 14 2015