|
| |
|
|
A120728
|
|
Floor of e^n, reduced modulo 3.
|
|
0
| |
|
|
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, 1, 2, 2, 2, 1, 0, 1, 2, 0, 2, 1, 0, 0, 0, 2, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| This sequence seems to be chaotic. Comes from trying to find an alternative function for the modulo for a real number that gives an integer.
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.
|
|
|
FORMULA
| a(n) = mod(floor(e^n), 3) = floor(e^n) - 3*floor(e^n/3)
|
|
|
MATHEMATICA
| Table[Mod[Floor[Exp[n]], 3], {n, 1, 50}]
Table[Floor[Exp[n]] - 3*Floor[Exp[n]/3], {n, 1, 50}]
|
|
|
CROSSREFS
| Sequence in context: A137853 A094114 A104607 * A092149 A171099 A127173
Adjacent sequences: A120725 A120726 A120727 * A120729 A120730 A120731
|
|
|
KEYWORD
| nonn,less
|
|
|
AUTHOR
| Roger Bagula (rlbagulatftn(AT)yahoo.com), Aug 19 2006
|
| |
|
|
