OFFSET
1,1
COMMENTS
There are no further solutions beyond a(46)=4539541 up to at least 10^10. - Andrew Howroyd, Mar 02 2018
LINKS
Anthony Sand, Table of n, a(n) for n = 1..46
FORMULA
prime(n) such that, using base 3, prime(n) = sum_{1..n-1} A239619(i) - sum_{index(n-1)}
EXAMPLE
67 = digit-sum(2..61,b=3) - digit-sum(index(61),b=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) + sum(2,1,2) + sum(1,0,0,2) + sum(1,0,1,1) + sum(1,1,0,1) + sum(1,1,1,2) + sum(1,1,2,1) + sum(1,2,0,2) + sum(1,2,2,2) + sum(2,0,1,2) + sum(2,0,2,1) - digit-sum(200).
PROG
(PARI)
seq(maxp)={my(p=1, L=List(), s=0, k=0); while(p<maxp, p=nextprime(p+1); if(p==s-vecsum(digits(k, 3)), listput(L, p)); k++; s+=vecsum(digits(p, 3))); Vec(L)}
seq(1e7) \\ Andrew Howroyd, Mar 01 2018
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Anthony Sand, May 01 2014
EXTENSIONS
a(29)-a(33) from Andrew Howroyd, Mar 02 2018
STATUS
approved