|
|
A129630
|
|
Numbers k such that sum of digits of (k+1) is a prime.
|
|
1
|
|
|
1, 2, 4, 6, 10, 11, 13, 15, 19, 20, 22, 24, 28, 29, 31, 33, 37, 40, 42, 46, 48, 49, 51, 55, 57, 60, 64, 66, 69, 73, 75, 82, 84, 88, 91, 93, 97, 100, 101, 103, 105, 109, 110, 112, 114, 118, 119, 121, 123, 127, 130, 132, 136, 138, 139, 141, 145, 147, 150, 154, 156, 159
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
P:=proc(n) local i, k, w; for i from 1 by 1 to n do w:=0; k:=binomial(i+1, i); while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if isprime(w) then print(i); fi; od; end: P(1000);
|
|
MATHEMATICA
|
Select[Range[200], PrimeQ[Total[IntegerDigits[# + 1]]] &]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|