|
Search: id:A111132
|
|
|
| A111132 |
|
a(n+1) = a(n) + [a(n) - a(n-1) + a(n) mod 10] mod 10 with a(0)=0 and a(1)=1. |
|
+0
1
|
|
| 1, 3, 8, 11, 15, 24, 27, 27, 34, 35, 41, 48, 53, 61, 70, 79, 87, 92, 99, 105, 106, 113, 113, 116, 125, 129, 132, 137, 139, 140, 141, 143, 148, 151, 155, 164, 167, 167, 174, 175, 181, 188, 193, 201, 210, 219, 227, 232, 239, 245, 246, 253, 253, 256, 265, 269, 272
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Similar to A111072 but moving right by a(n).
|
|
EXAMPLE
|
Write the sequence of natural number 0123456789 and repeat it infinite times. Then starting from the first "one" on the left side move right one number (on number 2) then make the sum 1+2=3. Now move right 3 (the result of the previous sum). We are on number 5; then make the sum 3+5=8 Repeating the process we get 1, 3, 8, 11, 15, 24, 27, 27, 34 .......
|
|
MAPLE
|
ANM:=proc(N) global anplus1, anminus1; local an, i, anpolus; anminus1:=0; an:=1; print (an); for i from 2 by 1 to N do anplus1:=an+((an-anminus1+ an mod 10) mod 10); print(anplus1); anminus1:=an; an:=anplus1; od; end: ANM(100);
|
|
CROSSREFS
|
Cf. A111072, A111093.
Sequence in context: A051245 A003157 A081858 this_sequence A003234 A047470 A003623
Adjacent sequences: A111129 A111130 A111131 this_sequence A111133 A111134 A111135
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giorgio Balzarotti & Paolo P. Lava (ppl(AT)spl.at), Oct 17 2005, corrected Sep 29 2006
|
|
|
Search completed in 0.002 seconds
|
