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 A258711 #23 Nov 05 2018 03:07:34
%S A258711 1,1,2,4,2,0,2,1,1,2,4,2,6,3,3,3,6,5,6,5,1,0,0,0,0,0,1,6,5,5,3,6,3,5,
%T A258711 5,2,2,4,1,4,4,0,1,1,2,4,2,0,2,1,1,2,4,2,0,2,1,1,2,4,2,6,3,3,3,6,5,6,
%U A258711 5,1,0,0,0,0,0,1,6,5,5,3,6,3,5,5,2,2,4,1,4
%N A258711 Motzkin numbers A001006 read mod 7.
%H A258711 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 A258711 Anders Hyllengren, <a href="/A258710/a258710.pdf">Letter to N. J. A. Sloane, Oct 04 1985</a>
%t A258711 m[0] = 1; m[n_] := m[n] = m[n-1] + Sum[m[k] m[n-k-2], {k, 0, n-2}];
%t A258711 a[n_] := Mod[m[n], 7];
%t A258711 Array[a, 100, 0] (* _Jean-François Alcover_, Nov 05 2018 *)
%o A258711 (PARI) a001006(n) = polcoeff((1-x-sqrt((1-x)^2-4*x^2+x^3*O(x^n)))/(2*x^2), n);
%o A258711 vector(200, n, n--; a001006(n) % 7) \\ _Altug Alkan_, Oct 23 2015
%Y A258711 Cf. A001006.
%Y A258711 Motzkin numbers A001006 read mod 2,3,4,5,6,7,8,11: A039963, A039964, A299919, A258712, A299920, A258711, A299918, A258710.
%K A258711 nonn
%O A258711 0,3
%A A258711 _N. J. A. Sloane_, Jun 14 2015