A141071 a(n) = prime(n) mod (sum of base-10 digits of n) where prime(n) is the n-th prime.

0, 1, 2, 3, 1, 1, 3, 3, 5, 0, 1, 1, 1, 3, 5, 4, 3, 7, 7, 1, 1, 3, 3, 5, 6, 5, 4, 7, 10, 2, 3, 1, 5, 6, 5, 7, 7, 9, 11, 1, 4, 1, 2, 1, 8, 9, 2, 7, 6, 4, 5, 1, 1, 8, 7, 10, 5, 11, 11, 5, 3, 5, 1, 1, 5, 5, 6, 1, 2, 6, 1, 8, 7, 10

Offset

1,3

Links

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

Prog

(PARI) a(n) = prime(n) % sumdigits(n); \\ Michel Marcus, Jan 05 2022

Crossrefs

Cf. A000040, A007953.

Sequence in context: A178795 A123185 A133569 * A004648 A265848 A139438

Adjacent sequences: A141068 A141069 A141070 * A141072 A141073 A141074

Keyword

nonn,base,less

Author

Juri-Stepan Gerasimov, Aug 04 2008

Extensions

Corrected and edited by D. S. McNeil, Mar 21 2009

Status

approved