A141063 a(n) = n mod (sum of digits of prime(n)).

1, 2, 3, 4, 1, 2, 7, 8, 4, 10, 3, 2, 3, 0, 4, 0, 3, 4, 6, 4, 1, 6, 1, 7, 9, 0, 3, 4, 9, 0, 1, 2, 0, 8, 7, 1, 11, 8, 11, 7, 7, 2, 10, 5, 11, 8, 3, 6, 5, 11, 3, 10, 4, 6, 13, 1, 6, 8, 11, 5, 9, 6, 3, 4, 2, 0, 4, 3, 13, 6, 5, 4, 9, 9, 18, 6, 17, 2, 4, 2, 11, 5, 3, 4, 5, 9, 2, 8, 1, 12, 6, 12, 17, 10, 7, 0, 13

Offset

1,2

Links

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

Example

Prime(1) = 2, so a(1) = 1 mod 2 = 1;
prime(5) = 11, so a(5) = 5 mod (1+1) = 5 mod 2 = 1.

Maple

sd:=proc(n) options operator, arrow: add(convert(n, base, 10)[j], j=1..nops(convert(n, base, 10))) end proc: seq(`mod`(n, sd(ithprime(n))), n=1..100); # Emeric Deutsch, Aug 16 2008

Prog

(PARI) a(n) = n % sumdigits(prime(n)); \\ Michel Marcus, Feb 18 2021

Crossrefs

Cf. A007605.

Sequence in context: A357143 A337210 A361258 * A138223 A194742 A159798

Adjacent sequences: A141060 A141061 A141062 * A141064 A141065 A141066

Keyword

nonn,base,less

Author

Juri-Stepan Gerasimov, Aug 04 2008

Extensions

Corrected and extended by Emeric Deutsch, Aug 16 2008

Status

approved