|
|
A087486
|
|
Numbers n such that digital sum of n divides digital sum of n-th prime, p(n).
|
|
0
|
|
|
1, 10, 11, 20, 22, 32, 52, 56, 88, 100, 101, 104, 125, 160, 175, 176, 182, 200, 212, 218, 223, 227, 248, 262, 263, 293, 295, 323, 331, 338, 341, 362, 377, 386, 394, 397, 398, 409, 410, 439, 442, 446, 457, 481, 499, 508, 521, 526, 533, 563, 571, 595, 599, 611
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
52 is in the sequence because prime(52)=239 and 5+2=7 divides 2+3+9=14.
|
|
PROG
|
(PARI) sod(n) = {digs = digits(n, 10); return (sum(j=1, #digs, digs[j])); }
isok(n) = (sod(prime(n)) % sod(n) == 0) \\ Michel Marcus, Jul 27 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|