OFFSET
1,1
COMMENTS
Conjecture: this sequence is finite and all terms are shown. - Robert G. Wilson v, Jul 27 2014
The sum of the digits in base three of all primes < 10^10 is 9694409092. - Robert G. Wilson v, Jul 27 2014
FORMULA
prime(n) such that, using base 3, prime(n) = sum_{1..n-1} A239619(i).
EXAMPLE
For example, 23 = digit-sum(primes < 23, base=3) = sum(2) + sum(1,0) + sum(1,2) + sum(2,1) + sum(1,0,2) + sum(1,1,1) + sum(1,2,2) + sum(2,0,1).
MATHEMATICA
p = 2; s = 0; lst = {}; While[p < 3200000, If[s == p, AppendTo[lst, p]; Print[p]]; s = s + Total@ IntegerDigits[p, 3]; p = NextPrime[p]] (* Robert G. Wilson v, Jul 27 2014 *)
PROG
(PARI) sdt(n) = my(d = digits(n, 3)); sum(i=1, #d, d[i]);
lista(nn) = {sp = 0; forprime(p=1, nn, if (p == sp, print1(p, ", ")); sp += sdt(p); ); } \\ Michel Marcus, May 02 2014
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Anthony Sand, Apr 14 2014
STATUS
approved