login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; 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.

LINKS

Table of n, a(n) for n=1..50.

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: A226460 A094114 A104607 * A092149 A171099 A127173

Adjacent sequences:  A120725 A120726 A120727 * A120729 A120730 A120731

KEYWORD

nonn,less

AUTHOR

Roger L. Bagula, Aug 19 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 23 10:56 EST 2018. Contains 299536 sequences. (Running on oeis4.)