Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107409
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107409 Each term is sum of three previous terms mod 10. +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, 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; listen)
OFFSET

0,3

COMMENT

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.

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: A078890 A021813 A082052 this_sequence A133031 A124795 A084459

Adjacent sequences: A107406 A107407 A107408 this_sequence A107410 A107411 A107412

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), May 25 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research