login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033955 a(n) = sum of the remainders when the n-th prime is divided by primes up to the (n-1)-th prime. 8
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; text; internal format)
OFFSET

1,3

COMMENTS

Row sums of A207409. - Bob Selcoe, Apr 14 2014

LINKS

Table of n, a(n) for n=1..53.

FORMULA

a(n) = sum(k=1..n-1, prime(n) mod prime(k) ).

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

(PARI) {for(n=1, 200, print1(sum(k=1, n, prime(n)%prime(k)), ", "))}

CROSSREFS

Cf. A067435, A067436, A024934, A207409.

Sequence in context: A245121 A153339 A275989 * 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, Mar 02 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 20 13:04 EDT 2017. Contains 290835 sequences.