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 A187466 #24 Jun 12 2016 03:14:11 %S A187466 1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3, %T A187466 5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1,9,4, %U A187466 3,5,1,9,4,3,5,1,9,4,3,5,1,9,4,3,5,1 %N A187466 a(n) = 9^n mod 11. %C A187466 Period 5: repeat [1, 9, 4, 3, 5]. %H A187466 Vincenzo Librandi, <a href="/A187466/b187466.txt">Table of n, a(n) for n = 0..1000</a> %H A187466 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1). %F A187466 G.f.: (5*x^4 + 3*x^3 + 4*x^2 + 9*x + 1)/(1 - x^5). - _Chai Wah Wu_, Jun 04 2016 %F A187466 a(n) = a(n-5) for n>4. - _Wesley Ivan Hurt_, Jun 11 2016 %p A187466 A187466:=n->9^n mod 11: seq(A187466(n), n=0..100); # _Wesley Ivan Hurt_, Jun 11 2016 %t A187466 PowerMod[9, Range[0, 100], 11] (* _Wesley Ivan Hurt_, Jun 11 2016 *) %o A187466 (PARI) a(n)=lift(Mod(9,11)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %Y A187466 Cf. A010691, A036117, A048271, A070341, A070367, A070392, A070404, A168429. %K A187466 nonn,easy %O A187466 0,2 %A A187466 _M. F. Hasler_, Mar 10 2011