OFFSET
1,4
LINKS
Iain Fox, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = floor(e^n) mod prime(n).
EXAMPLE
The sixth term is 0 because e^6 is 403.42879... and 403 is a multiple of 13, the sixth prime.
MAPLE
A119380:=n->floor(exp(1)^n) mod ithprime(n): seq(A119380(n), n=1..100); # Wesley Ivan Hurt, Nov 30 2017
MATHEMATICA
Table[Mod[Floor[E^n], Prime[n]], {n, 1, 100}] (* Stefan Steinerberger, Jul 26 2006 *)
PROG
(PARI) a(n) = floor(exp(n))%prime(n) \\ Iain Fox, Nov 30 2017
CROSSREFS
KEYWORD
easy,nonn,less
AUTHOR
Axel Harvey, Jul 24 2006
EXTENSIONS
More terms from Stefan Steinerberger, Jul 26 2006
STATUS
approved