A216100 a(n) = 11^n mod 100.
1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 1
Offset: 0
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..200
- Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,1).
Programs
-
Mathematica
CoefficientList[Series[(1 + 11 x + 21 x^2 + 31 x^3 + 41 x^4 + 51 x^5 + 61 x^6 + 71 x^7 + 81 x^8 + 91 x^9) / ((1 - x) (1 + x) (1 - x + x^2 - x^3 + x^4) (1 + x + x^2 + x^3 + x^4)), {x, 0, 60}], x] (* Vincenzo Librandi, Jun 14 2013 *) PowerMod[11,Range[0,100],100] (* or *) PadRight[{},100,{1,11,21,31,41,51,61,71,81,91}] (* Harvey P. Dale, Jul 31 2023 *) -
PARI
for(i=1, 100, print(11^i%100, ", "))
Formula
G.f.: (1+11*x+21*x^2+31*x^3+41*x^4+51*x^5+61*x^6+71*x^7+81*x^8+91*x^9)/((1-x)*(1+x)*(1-x+x^2-x^3+x^4)*(1+x+x^2+x^3+x^4)). - Bruno Berselli, Sep 14 2012
Comments