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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140684 A037481 mod 10. 0
 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2, 9, 8, 3, 4, 7, 0, 1, 6, 5, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The sequence is periodic with length 10 and contains all 10 digits. The first differences 1, 5, -1, -3, 7, -1, -5, 1, 3, -7 are also periodic with period length 10. LINKS FORMULA a(n) = A037481(n) mod 10. a(n)= a(n-10). a(n)+a(n+5)= A010734(n). O.g.f.: (7x^4-3x^3-x^2+5x+1)x/((1-x)(1+x)(x^4-x^3+x^2-x+1)). - R. J. Mathar, Jul 14 2008 a(n)=(1/5)*{4*(n mod 10)-[(n+1) mod 10]+3*[(n+3) mod 10]+[(n+4) mod 10]-3*[(n+5) mod 10]+2*[(n+6) mod 10]+[(n+7) mod 10]-2*[(n+8) mod 10]}, with n>=0 - Paolo P. Lava, Jul 14 2008 CROSSREFS Sequence in context: A178959 A266998 A021609 * A245632 A158038 A259281 Adjacent sequences:  A140681 A140682 A140683 * A140685 A140686 A140687 KEYWORD nonn,base AUTHOR Paul Curtz, Jul 11 2008 EXTENSIONS Edited by R. J. Mathar, Jul 14 2008 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 June 2 17:02 EDT 2020. Contains 334787 sequences. (Running on oeis4.)