|
%I #13 Dec 18 2022 08:41:55
%S 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 1,2,2,2,1,0,1,2,0,2,1,0,0,0,2,1
%N a(n) = floor(e^n) modulo 3.
%C 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.
%t Table[Mod[Floor[Exp[n]], 3], {n, 1, 50}]
%t Table[Floor[Exp[n]] - 3*Floor[Exp[n]/3], {n, 1, 50}]
%K nonn,less
%O 1,1
%A _Roger L. Bagula_, Aug 19 2006
|
