The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A141063 a(n) = n mod (sum of digits of prime(n)). 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS 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: A299756 A163258 A337210 * 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

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

Last modified June 18 07:25 EDT 2021. Contains 345098 sequences. (Running on oeis4.)