login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A173683 Sum of n mod p, for p=2, 3, 5, ..., smallest prime>=n. 1
1, 0, 1, 5, 3, 7, 4, 14, 16, 14, 8, 20, 13, 24, 23, 28, 18, 38, 27, 48, 47, 43, 29, 57, 62, 57, 64, 65, 46, 76, 56, 97, 95, 88, 88, 95, 70, 99, 96, 102, 74, 117, 88, 133, 140, 130, 98, 156, 165, 174, 170, 171, 134, 199, 200, 208, 203, 189, 147, 214 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000

EXAMPLE

a(1) = 1 because (1 mod 2) = 1 where 2 = smallest prime >= 1.

MAPLE

a:= n-> add (n mod ithprime(i), i=1..numtheory[pi] (nextprime(n-1))):

seq (a(n), n=1..60);  # Alois P. Heinz, Nov 25 2010

CROSSREFS

Cf. A099726.

Sequence in context: A021953 A171530 A266684 * A099408 A110265 A275415

Adjacent sequences:  A173680 A173681 A173682 * A173684 A173685 A173686

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov, Nov 25 2010

EXTENSIONS

More terms from Alois P. Heinz, Nov 25 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 17:42 EDT 2022. Contains 353957 sequences. (Running on oeis4.)