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 A120728 #17 May 25 2025 20:43:48
%S A120728 2,1,2,0,1,1,1,1,0,0,0,1,0,0,1,2,2,1,0,2,2,2,1,1,1,2,2,0,2,1,2,0,2,1,
%T A120728 1,2,2,2,1,0,1,2,0,2,1,0,0,0,2,1
%N A120728 a(n) = floor(e^n) modulo 3.
%C A120728 This sequence is not unique to e; there are infinitely many numbers x such that mod(floor(x^n), 3) will produce the same sequence. - _Franklin T. Adams-Watters_, Sep 29 2011
%F A120728 a(n) = A000149(n) modulo 3. - _Jason Yuen_, May 25 2025
%t A120728 Table[Mod[Floor[Exp[n]], 3], {n, 1, 50}]
%t A120728 Table[Floor[Exp[n]] - 3*Floor[Exp[n]/3], {n, 1, 50}]
%Y A120728 Cf. A000149.
%K A120728 nonn,less
%O A120728 1,1
%A A120728 _Roger L. Bagula_, Aug 19 2006