|
| |
|
|
A033955
|
|
a(n) = sum of the remainders when the n-th prime is divided by primes up to the (n-1)-th prime.
|
|
7
| |
|
|
0, 1, 3, 4, 8, 13, 18, 27, 29, 46, 56, 70, 74, 88, 98, 134, 147, 171, 200, 217, 252, 274, 309, 323, 348, 418, 448, 471, 522, 571, 629, 685, 739, 777, 793, 853, 954, 997, 1002, 1120, 1148, 1220, 1338, 1419, 1466, 1540, 1615, 1573, 1633, 1707, 1825, 1892, 1986
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
FORMULA
| a(n) = Sum{_1<=z<n} (prime(n) mod prime(z)).
|
|
|
EXAMPLE
| a(5) = 8. The remainders when the fifth prime 11 is divided by 2, 3, 5, 7 are 1, 2, 1, 4, respectively and their sum = 8.
|
|
|
MATHEMATICA
| a[n_] := Sum[Mod[Prime[n], Prime[i]], {i, 1, n-1}]
|
|
|
PROG
| for(y=2; y<infini; y++){ x=1; while(x<y) { a(n)=prime(y)%prime(x); x++}}
(PARI){for(n=1, 200, print1(sum(k=1, n, prime(n)%prime(k)), ", "))}
|
|
|
CROSSREFS
| Cf. A067435, A067436, A024934.
Sequence in context: A052952 A074331 A153339 * A049720 A078172 A022308
Adjacent sequences: A033952 A033953 A033954 * A033956 A033957 A033958
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Armand Turpel (armandt(AT)unforgettable.com)
|
|
|
EXTENSIONS
| Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 02 2002
|
| |
|
|
