|
Search: id:A141062
|
|
|
| A141062 |
|
a(n)=(p(n)-1) mod (sum of digits of p(n)). |
|
+0
1
|
|
| 1, 2, 4, 6, 0, 0, 0, 8, 2, 6, 2, 6, 0, 0, 2, 4, 2, 4, 1, 6, 2, 14, 5, 3, 0, 0, 2, 2, 8, 2, 6, 0, 4, 8, 8, 3, 0, 2, 12, 7, 8, 0, 3, 10, 9, 8, 2, 5, 6, 7, 0, 0, 2, 2, 4, 9, 13, 0, 4, 5, 9, 12, 6, 0, 4, 8, 1, 11, 10, 12, 0, 1, 14, 8, 17, 4, 8, 16, 0, 5, 12, 0, 6, 2, 6, 2, 6, 8, 9, 7, 7, 18, 11, 0, 14, 6, 4, 0, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
If n=1 and p(1)-1=1, then a(1)=1 (mod 2).
If n=2 and p(2)-1=2, then a(2)=2 (mod 3).
If n=3 and p(3)-1=4, then a(3)=4 (mod 5).
If n=4 and p(4)-1=6, then a(4)=6 (mod 7).
If n=5 and p(5)-1=10, then a(5)=0 (mod (1+1))
If n=6 and p(6)-1=12, then a(6)=0 (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`(ithprime(n)-1, sd(ithprime(n))), n= 1..100); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 23 2008]
|
|
CROSSREFS
|
Sequence in context: A056683 A066684 A128124 this_sequence A131806 A004518 A013670
Adjacent sequences: A141059 A141060 A141061 this_sequence A141063 A141064 A141065
|
|
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 23 2008
|
|
|
Search completed in 0.002 seconds
|
