This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A119380 #17 Dec 02 2017 02:27:35
%S A119380 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 A119380 4,64,83,103,45,53,49,37,26,19,75,20,147,20,134,73,56,17,31,89,143,
%U A119380 200,103,170,25,37,159,181,90,242,16,93,222,163,57,132,214,71,164,57,62,14
%N A119380 Remainder when the integer part of e^n is divided by the n-th prime number.
%H A119380 Iain Fox, <a href="/A119380/b119380.txt">Table of n, a(n) for n = 1..10000</a>
%F A119380 a(n) = floor(e^n) mod prime(n).
%e A119380 The sixth term is 0 because e^6 is 403.42879... and 403 is a multiple of 13, the sixth prime.
%p A119380 A119380:=n->floor(exp(1)^n) mod ithprime(n): seq(A119380(n), n=1..100); # _Wesley Ivan Hurt_, Nov 30 2017
%t A119380 Table[Mod[Floor[E^n], Prime[n]], {n, 1, 100}] (* _Stefan Steinerberger_, Jul 26 2006 *)
%o A119380 (PARI) a(n) = floor(exp(n))%prime(n) \\ _Iain Fox_, Nov 30 2017
%Y A119380 Cf. A000149.
%K A119380 easy,nonn,less
%O A119380 1,4
%A A119380 _Axel Harvey_, Jul 24 2006
%E A119380 More terms from _Stefan Steinerberger_, Jul 26 2006