login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066433 a(n) = floor(e^n mod n^e). 1
0, 0, 0, 11, 68, 12, 105, 130, 251, 71, 269, 581, 830, 1007, 250, 1449, 2048, 1365, 474, 3014, 2518, 271, 741, 813, 5628, 3286, 1281, 3382, 1005, 3653, 10353, 4821, 8630, 8771, 4206, 10301, 4303, 19511, 13509, 8240, 2667, 17448, 22484, 24090, 13233 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

MATHEMATICA

Table[ Floor[ Mod[ E^n, n^E]], {n, 1, 45} ]

PROG

(PARI) { default(realprecision, 1000); e=exp(1); for (n=1, 1000, write("b066433.txt", n, " ", floor(e^n % n^e)) ) } \\ Harry J. Smith, Feb 14 2010

CROSSREFS

Sequence in context: A228032 A145833 A111931 * A038741 A292490 A169731

Adjacent sequences:  A066430 A066431 A066432 * A066434 A066435 A066436

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Dec 27 2001

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 12:26 EDT 2021. Contains 343995 sequences. (Running on oeis4.)