A216095 a(n) = 2^n mod 10000.
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 6384, 2768, 5536, 1072, 2144, 4288, 8576, 7152, 4304, 8608, 7216, 4432, 8864, 7728, 5456, 912, 1824, 3648, 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
Offset: 0
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..1000 (first 504 terms from V. Raman)
- Index entries for linear recurrences with constant coefficients, order 251.
Programs
-
Magma
[Modexp(2, n, 10000): n in [0..110]]; // Vincenzo Librandi, Aug 16 2016
-
Mathematica
PowerMod[2, Range[0, 100], 10000] (* Vincenzo Librandi, Aug 16 2016 *)
-
PARI
for(i=0,500,print(2^i%10000" "))
Formula
For n > 255: a(n) = a(n-1) - a(n-250) + a(n-251). - Ray Chandler, Aug 09 2025
Comments