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 A216095 #26 Aug 09 2025 12:54:18 %S A216095 1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,6384,2768,5536,1072, %T A216095 2144,4288,8576,7152,4304,8608,7216,4432,8864,7728,5456,912,1824,3648, %U A216095 7296,4592,9184,8368,6736,3472,6944,3888,7776,5552,1104,2208,4416,8832,7664,5328,656,1312,2624,5248,496,992,1984,3968,7936,5872,1744,3488,6976,3952,7904,5808 %N A216095 a(n) = 2^n mod 10000. %C A216095 Period = 500. %H A216095 Vincenzo Librandi, <a href="/A216095/b216095.txt">Table of n, a(n) for n = 0..1000</a> (first 504 terms from V. Raman) %H A216095 <a href="/index/Rec#order_251">Index entries for linear recurrences with constant coefficients</a>, order 251. %F A216095 For n > 255: a(n) = a(n-1) - a(n-250) + a(n-251). - _Ray Chandler_, Aug 09 2025 %t A216095 PowerMod[2, Range[0, 100], 10000] (* _Vincenzo Librandi_, Aug 16 2016 *) %o A216095 (PARI) for(i=0,500,print(2^i%10000" ")) %o A216095 (Magma) [Modexp(2, n, 10000): n in [0..110]]; // _Vincenzo Librandi_, Aug 16 2016 %Y A216095 Cf. A000855, A126605, A000689. %K A216095 nonn,base,less,easy %O A216095 0,2 %A A216095 _V. Raman_, Sep 01 2012