login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A343812
a(n) = Sum_{i<=n} (A007504(n) mod prime(i)).
2
0, 3, 1, 8, 10, 20, 22, 27, 41, 80, 74, 94, 109, 150, 170, 125, 184, 219, 275, 286, 340, 419, 353, 421, 680, 599, 572, 626, 736, 780, 784, 828, 921, 1209, 1122, 934, 1204, 1359, 1568, 1649, 1963, 1511, 1320, 1819, 2016, 2238, 2329, 2272, 2454, 2846, 2834, 2551, 2659, 3175, 3089, 2839, 3374, 3382
OFFSET
1,2
COMMENTS
Does any term occur more than once?
LINKS
EXAMPLE
A007504(6) = 2+3+5+7+11+13 = 41 so a(6) = (41 mod 2)+(41 mod 3)+(41 mod 5)+(41 mod 7)+(41 mod 11)+(41 mod 13) = 20.
MAPLE
P:= [seq(ithprime(i), i=1..100)]:
S:= ListTools:-PartialSums(P):
seq(add(S[n] mod P[k], k=1..n), n=1..100);
CROSSREFS
Sequence in context: A178301 A120236 A049760 * A357847 A019146 A102537
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Apr 30 2021
STATUS
approved