OFFSET
1,1
COMMENTS
Primes written in base 3.
REFERENCES
Archimedeans Problems Drive, Eureka, 23 (1960), 23.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. D. Noe, Table of n, a(n) for n = 1..847
FORMULA
MATHEMATICA
Table[FromDigits[IntegerDigits[Prime[n], 3]], {n, 50}] (* T. D. Noe, Jun 28 2012 *)
PROG
(PARI) a(n)=subst(Pol(digits(prime(n), 3)), 'x, 10) \\ Charles R Greathouse IV, Nov 06 2013
CROSSREFS
KEYWORD
base,nonn,easy
AUTHOR
EXTENSIONS
More terms from James A. Sellers, May 01 2000
STATUS
approved