This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A001363 M1961 N0776 #34 Jul 02 2025 16:01:54
%S A001363 2,10,12,21,102,111,122,201,212,1002,1011,1101,1112,1121,1202,1222,
%T A001363 2012,2021,2111,2122,2201,2221,10002,10022,10121,10202,10211,10222,
%U A001363 11001,11012,11201,11212,12002,12011,12112,12121,12211,20001,20012,20102,20122,20201
%N A001363 Primes in ternary.
%C A001363 Primes written in base 3.
%D A001363 Archimedeans Problems Drive, Eureka, 23 (1960), 23.
%D A001363 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001363 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001363 T. D. Noe, <a href="/A001363/b001363.txt">Table of n, a(n) for n = 1..847</a>
%F A001363 a(n) = A007089(A000040(n)). - _Jonathan Vos Post_, Sep 09 2006
%t A001363 Table[FromDigits[IntegerDigits[Prime[n], 3]], {n, 50}] (* _T. D. Noe_, Jun 28 2012 *)
%o A001363 (PARI) a(n)=subst(Pol(digits(prime(n),3)),'x,10) \\ _Charles R Greathouse IV_, Nov 06 2013
%Y A001363 Analogs in other bases: A004676 (base 2), A001363 (base 3), A004678 (base 4), A004679 (base 5), A004680 (base 6), A004681 (base 7), A004682 (base 8), A004683 (base 9), A000040 (base 10), A004684 (base 11).
%Y A001363 Cf. A007089, A072805 (primes of form 4k+3 written in base 3).
%K A001363 base,nonn,easy
%O A001363 1,1
%A A001363 _N. J. A. Sloane_
%E A001363 More terms from _James Sellers_, May 01 2000