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 A126605 #34 Aug 09 2025 12:52:41
%S A126605 1,2,4,8,16,32,64,128,256,512,24,48,96,192,384,768,536,72,144,288,576,
%T A126605 152,304,608,216,432,864,728,456,912,824,648,296,592,184,368,736,472,
%U A126605 944,888,776,552,104,208,416,832,664,328,656,312,624,248,496,992,984,968
%N A126605 Final three digits of 2^n.
%C A126605 Has period 100. Sequence of last four digits has period 500. Cf. A000855 Final two digits of 2^n, has period 20.
%H A126605 V. Raman and Vincenzo Librandi, <a href="/A126605/b126605.txt">Table of n, a(n) for n = 0..1000</a> (first 103 terms from V. Raman)
%H A126605 <a href="/index/Rec#order_51">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-1,1).
%F A126605 For n > 54: a(n) = a(n-1) - a(n-50) + a(n-51). - _Ray Chandler_, Aug 09 2025
%t A126605 Table[PowerMod[2,n,1000],{n,0,1000}]
%o A126605 (PARI) for(i=0,103,print(i" "(2^i)%1000)) \\ _V. Raman_, Sep 01 2012
%o A126605 (Magma) [Modexp(2, n, 1000): n in [0..110]]; // _Vincenzo Librandi_, Aug 16 2016
%Y A126605 Cf. A000689, A000855.
%K A126605 nonn,base,easy
%O A126605 0,2
%A A126605 _Zak Seidov_, Mar 13 2007