This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A140684 #9 Dec 12 2023 08:31:16 %S A140684 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, %T A140684 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, %U A140684 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 %N A140684 A037481 mod 10. %C A140684 The sequence is periodic with length 10 and contains all 10 digits. %C A140684 The first differences 1, 5, -1, -3, 7, -1, -5, 1, 3, -7 are also periodic with period length 10. %F A140684 a(n) = A037481(n) mod 10. a(n)= a(n-10). %F A140684 a(n)+a(n+5)= A010734(n). %F A140684 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 %K A140684 nonn,base %O A140684 0,3 %A A140684 _Paul Curtz_, Jul 11 2008 %E A140684 Edited by _R. J. Mathar_, Jul 14 2008