Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Dec 02 2017 02:27:35
%S 0,1,0,5,5,0,8,16,7,15,13,28,23,23,26,24,57,57,62,43,70,49,36,64,84,3,
%T 4,64,83,103,45,53,49,37,26,19,75,20,147,20,134,73,56,17,31,89,143,
%U 200,103,170,25,37,159,181,90,242,16,93,222,163,57,132,214,71,164,57,62,14
%N Remainder when the integer part of e^n is divided by the n-th prime number.
%H Iain Fox, <a href="/A119380/b119380.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = floor(e^n) mod prime(n).
%e The sixth term is 0 because e^6 is 403.42879... and 403 is a multiple of 13, the sixth prime.
%p A119380:=n->floor(exp(1)^n) mod ithprime(n): seq(A119380(n), n=1..100); # _Wesley Ivan Hurt_, Nov 30 2017
%t Table[Mod[Floor[E^n], Prime[n]], {n, 1, 100}] (* _Stefan Steinerberger_, Jul 26 2006 *)
%o (PARI) a(n) = floor(exp(n))%prime(n) \\ _Iain Fox_, Nov 30 2017
%Y Cf. A000149.
%K easy,nonn,less
%O 1,4
%A _Axel Harvey_, Jul 24 2006
%E More terms from _Stefan Steinerberger_, Jul 26 2006