login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216100 a(n) = 11^n mod 100. 3

%I #32 Feb 17 2024 06:30:37

%S 1,11,21,31,41,51,61,71,81,91,1,11,21,31,41,51,61,71,81,91,1,11,21,31,

%T 41,51,61,71,81,91,1,11,21,31,41,51,61,71,81,91,1,11,21,31,41,51,61,

%U 71,81,91,1

%N a(n) = 11^n mod 100.

%C Period = 10.

%C Continued fraction expansion of ( 34677540795827 + sqrt(1251987878366961879130415285) ) / 64245607918014. - _Bruno Berselli_, Sep 14 2012

%H Vincenzo Librandi, <a href="/A216100/b216100.txt">Table of n, a(n) for n = 0..200</a>

%H <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 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

%t 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 *)

%t 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 *)

%o (PARI) for(i=1, 100, print(11^i%100, ", "))

%Y Cf. A001311, A014390.

%K nonn,easy,less

%O 0,2

%A _V. Raman_, Sep 01 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 06:47 EDT 2024. Contains 372300 sequences. (Running on oeis4.)