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 A105955 #26 Sep 08 2022 08:45:17 %S A105955 0,1,1,2,3,5,8,2,10,1,0,1,1,2,3,5,8,2,10,1,0,1,1,2,3,5,8,2,10,1,0,1,1, %T A105955 2,3,5,8,2,10,1,0,1,1,2,3,5,8,2,10,1,0,1,1,2,3,5,8,2,10,1,0,1,1,2,3,5, %U A105955 8,2,10,1,0,1,1,2,3,5,8,2,10,1,0,1,1,2,3,5,8,2,10,1,0,1,1,2,3,5,8,2,10,1,0 %N A105955 a(n) = Fibonacci(n) mod 11. %H A105955 Vincenzo Librandi, <a href="/A105955/b105955.txt">Table of n, a(n) for n = 0..1000</a> %H A105955 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,1). %F A105955 From _Colin Barker_, Jan 02 2018: (Start) %F A105955 G.f.: x*(1 + x + 2*x^2 + 3*x^3 + 5*x^4 + 8*x^5 + 2*x^6 + 10*x^7 + x^8) / ((1 - x)*(1 + x)*(1 - x + x^2 - x^3 + x^4)*(1 + x + x^2 + x^3 + x^4)). %F A105955 a(n) = 38*a(n-7) - a(n-14) for n>9. %F A105955 (End) %e A105955 Sequence is periodic with Pisano period 10. - Corrected by U. Takasi, Dec 27 2009 %t A105955 Mod[Fibonacci[Range[0, 100]], 11] (* _Harvey P. Dale_, Jul 27 2012 *) %o A105955 (Magma) [Fibonacci(n) mod 11: n in [0..100]]; // _Vincenzo Librandi_, Feb 04 2014 %o A105955 (PARI) for(n=0,100, print1(fibonacci(n)%11, ", ")) \\ _G. C. Greubel_, Jan 01 2018 %o A105955 (PARI) concat(0, Vec(x*(1 + x + 2*x^2 + 3*x^3 + 5*x^4 + 8*x^5 + 2*x^6 + 10*x^7 + x^8) / ((1 - x)*(1 + x)*(1 - x + x^2 - x^3 + x^4)*(1 + x + x^2 + x^3 + x^4)) + O(x^100))) \\ _Colin Barker_, Jan 02 2018 %K A105955 nonn,easy %O A105955 0,4 %A A105955 _Shyam Sunder Gupta_, May 05 2005 %E A105955 Added a(0)=0 from _Vincenzo Librandi_, Feb 04 2014