login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299920 Motzkin numbers (A001006) mod 6. 9
1, 1, 2, 4, 3, 3, 3, 1, 5, 1, 4, 2, 1, 3, 0, 0, 3, 3, 0, 0, 3, 3, 3, 3, 3, 1, 2, 4, 1, 5, 1, 3, 3, 3, 4, 2, 1, 1, 5, 1, 3, 3, 0, 0, 3, 3, 0, 0, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 0, 0, 3, 3, 0, 0, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 0, 0, 3, 3, 0, 4, 5, 1, 4, 2, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..10000

MAPLE

f:= gfun:-rectoproc({(3+3*n)*a(n)+(5+2*n)*a(1+n)+(-4-n)*a(n+2), a(0) = 1, a(1) = 1}, a(n), remember):

seq(f(n) mod 6, n=0..100); # Robert Israel, Mar 16 2018

MATHEMATICA

b = DifferenceRoot[Function[{b, n}, {3 (n + 1) b[n] + (2 n + 5) b[n + 1] == (n + 4) b[n + 2], b[0] == 1, b[1] == 1}]];

a[n_] := Mod[b[n], 6];

Table[a[n], {n, 0, 100}] (* Jean-Fran├žois Alcover, Feb 26 2019 *)

CROSSREFS

Motzkin numbers A001006 read mod 2,3,4,5,6,7,8,11: A039963, A039964, A299919, A258712, A299920, A258711, A299918, A258710.

Sequence in context: A244646 A308182 A220080 * A137363 A110549 A174574

Adjacent sequences:  A299917 A299918 A299919 * A299921 A299922 A299923

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mar 16 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 24 07:53 EST 2020. Contains 338607 sequences. (Running on oeis4.)