|
Search: id:A119380
|
|
|
| A119380 |
|
Remainder when the integer part of e^n is divided by the n-th prime number. |
|
+0
1
|
|
| 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, 4, 64, 83, 103, 45, 53, 49, 37, 26, 19, 75, 20, 147, 20, 134, 73, 56, 17, 31, 89, 143, 200, 103, 170, 25, 37, 159, 181, 90, 242, 16, 93, 222, 163, 57, 132, 214, 71, 164, 57, 62, 14
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
FORMULA
|
a(n)=mod(int(e^n),prime(n))
|
|
EXAMPLE
|
The sixth term is 0 because e^6 is 403.42879... and 403 is a multiple of 13, the sixth prime.
|
|
MATHEMATICA
|
Table[Mod[Floor[E^n], Prime[n]], {n, 1, 100}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 26 2006
|
|
CROSSREFS
|
Sequence in context: A065936 A021649 A144184 this_sequence A121212 A133337 A022697
Adjacent sequences: A119377 A119378 A119379 this_sequence A119381 A119382 A119383
|
|
KEYWORD
|
easy,nonn,less
|
|
AUTHOR
|
Axel Harvey (ax(AT)hirsig.ca), Jul 24 2006
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 26 2006
|
|
|
Search completed in 0.002 seconds
|
