This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258711 Motzkin numbers A001006 read mod 7. 9
 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, 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, 5, 1, 0, 0, 0, 0, 0, 1, 6, 5, 5, 3, 6, 3, 5, 5, 2, 2, 4, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Rob Burns, Structure and asymptotics for Motzkin numbers modulo small primes using automata, arXiv:1612.08146 [math.NT], 2016. Anders Hyllengren, Letter to N. J. A. Sloane, Oct 04 1985 MATHEMATICA m[0] = 1; m[n_] := m[n] = m[n-1] + Sum[m[k] m[n-k-2], {k, 0, n-2}]; a[n_] := Mod[m[n], 7]; Array[a, 100, 0] (* Jean-François Alcover, Nov 05 2018 *) PROG (PARI) a001006(n) = polcoeff((1-x-sqrt((1-x)^2-4*x^2+x^3*O(x^n)))/(2*x^2), n); vector(200, n, n--; a001006(n) % 7) \\ Altug Alkan, Oct 23 2015 CROSSREFS Cf. A001006. Motzkin numbers A001006 read mod 2,3,4,5,6,7,8,11: A039963, A039964, A299919, A258712, A299920, A258711, A299918, A258710. Sequence in context: A318222 A209466 A277659 * A127278 A202069 A300329 Adjacent sequences:  A258708 A258709 A258710 * A258712 A258713 A258714 KEYWORD nonn AUTHOR N. J. A. Sloane, Jun 14 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 04:06 EDT 2019. Contains 327212 sequences. (Running on oeis4.)