|
Search: id:A141063
|
|
|
| A141063 |
|
a(n)=n mod (sum of digits of p(n)). |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
If n=1 and p(1)=2, then a(1)=1 (mod 2).
If n=2 and p(2)=3, then a(2)=2 (mod 3).
If n=3 and p(3)=5, then a(3)=3 (mod 5).
If n=4 and p(4)=7, then a(4)=4 (mod 7).
If n=5 and p(5)=11, then a(5)=1 (mod (1+1))
If n=6 and p(6)=13, then a(6)=2 (mod (1+3)), etc.
|
|
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); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 16 2008]
|
|
CROSSREFS
|
Sequence in context: A024855 A074057 A163258 this_sequence A138223 A159798 A003324
Adjacent sequences: A141060 A141061 A141062 this_sequence A141064 A141065 A141066
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru) Aug 4 2008
|
|
EXTENSIONS
|
Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 16 2008
|
|
|
Search completed in 0.002 seconds
|
