This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A107410 Each term is sum of three previous terms mod 9. 0
 0, 1, 2, 3, 6, 2, 2, 1, 5, 8, 5, 0, 4, 0, 4, 8, 3, 6, 8, 8, 4, 2, 5, 2, 0, 7, 0, 7, 5, 3, 6, 5, 5, 7, 8, 2, 8, 0, 1, 0, 1, 2, 3, 6, 2, 2, 1, 5, 8, 5, 0, 4, 0, 4, 8, 3, 6, 8, 8, 4, 2, 5, 2, 0, 7, 0, 7, 5, 3, 6, 5, 5, 7, 8, 2, 8, 0, 1, 0, 1, 2, 3, 6, 2, 2, 1, 5, 8, 5, 0, 4, 0, 4, 8, 3, 6, 8, 8, 4, 2, 5, 2, 0, 7, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The sequence has period: {0,1,2,3,6,2,2,1,5,8,5,0,4,0,4,8,3,6,8,8,4,2,5,2,0,7,0,7,5,3,6,5,5,7,8,2,8,0,1} of length = 39. LINKS Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1). FORMULA a(n)=mod(a(n-1)+a(n-2)+a(n-3), 9); a(1)=0, a(2)=1;a(3)=2. MATHEMATICA s={a=0, b=1, c=2}; Do[d=Mod[a+b+c, 8]; s=Append[s, d]; a=b; b=c; c=d, {m, 200}]; s CROSSREFS Sequence in context: A093095 A002171 A138515 * A132041 A153634 A224910 Adjacent sequences:  A107407 A107408 A107409 * A107411 A107412 A107413 KEYWORD nonn,easy AUTHOR Zak Seidov, May 25 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 24 14:59 EDT 2013. Contains 225624 sequences.