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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000855 Final two digits of 2^n. 8
 1, 2, 4, 8, 16, 32, 64, 28, 56, 12, 24, 48, 96, 92, 84, 68, 36, 72, 44, 88, 76, 52, 4, 8, 16, 32, 64, 28, 56, 12, 24, 48, 96, 92, 84, 68, 36, 72, 44, 88, 76, 52, 4, 8, 16, 32, 64, 28, 56, 12, 24, 48, 96, 92, 84, 68, 36, 72, 44, 88, 76, 52, 4, 8, 16, 32, 64, 28 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Has period 20 (starting with a(2)=4). LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 Index entries for sequences related to final digits of numbers Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,-1,1). FORMULA G.f.: -(50*x^12 +25*x^11 +13*x^10 -44*x^9 +28*x^8 -36*x^7 +32*x^6 +16*x^5 +8*x^4 +4*x^3 +2*x^2 +x +1) / ((x -1)*(x^2 +1)*(x^8 -x^6 +x^4 -x^2 +1)). - Colin Barker, Dec 01 2014 MATHEMATICA PowerMod[2, Range[0, 60], 100] (* Harvey P. Dale, Jan 05 2012 *) PROG (PARI) a(n)=lift(Mod(2, 100)^n) \\ Charles R Greathouse IV, Dec 28 2012 CROSSREFS Cf. A000689, A126605. Sequence in context: A223700 A036140 A036138 * A036135 A036131 A115424 Adjacent sequences: A000852 A000853 A000854 * A000856 A000857 A000858 KEYWORD nonn,base,easy AUTHOR N. J. A. Sloane STATUS approved

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.

Last modified December 10 04:24 EST 2023. Contains 367699 sequences. (Running on oeis4.)