This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A107409 Each term is sum of three previous terms mod 10. 0
 0, 1, 2, 3, 6, 1, 0, 7, 8, 5, 0, 3, 8, 1, 2, 1, 4, 7, 2, 3, 2, 7, 2, 1, 0, 3, 4, 7, 4, 5, 6, 5, 6, 7, 8, 1, 6, 5, 2, 3, 0, 5, 8, 3, 6, 7, 6, 9, 2, 7, 8, 7, 2, 7, 6, 5, 8, 9, 2, 9, 0, 1, 0, 1, 2, 3, 6, 1, 0, 7, 8, 5, 0, 3, 8, 1, 2, 1, 4, 7, 2, 3, 2, 7, 2, 1, 0, 3, 4, 7, 4, 5, 6, 5, 6, 7, 8, 1, 6, 5, 2, 3, 0, 5, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The sequence has period: {0,1,2,3,6,1,0,7,8,5,0,3,8,1,2,1,4,7,2,3,2,7,2,1,0,3,4,7,4,5,6,5,6,7,8,1,6,5,2,3,0,5,8,3,6,7,6,9,2,7,8,7,2,7,6,5,8,9,2,9,0,1} of length = 62. LINKS FORMULA a(n)=mod(a(n-1)+a(n-2)+a(n-3), 10); a(1)=0, a(2)=1;a(3)=2. MATHEMATICA s={a=0, b=1, c=2}; Do[d=Mod[a+b+c, 10]; s=Append[s, d]; a=b; b=c; c=d, {m, 200}]; s CROSSREFS Sequence in context: A232930 A217100 A241293 * A268603 A226871 A178483 Adjacent sequences:  A107406 A107407 A107408 * A107410 A107411 A107412 KEYWORD nonn 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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 15 22:02 EST 2019. Contains 330012 sequences. (Running on oeis4.)