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 A073779 #27 Sep 08 2022 08:45:06
%S A073779 0,1,0,0,1,0,0,1,0,2,1,1,0,0,1,0,1,1,0,0,1,0,3,2,1,2,1,1,2,1,1,0,2,1,
%T A073779 0,0,0,3,2,2,1,2,2,1,1,1,0,1,1,0,0,0,0,3,2,3,2,3,2,2,1,1,2,1,1,2,2,1,
%U A073779 1,1,2,1,0,0,2,1,1,1,0,2,1,1,1,2,1,1,0,0,2,1,1,1,4,3,2,2,2,2,2,3,2,1,1,3,2
%N A073779 Number of 0's in base-3 representation of n-th prime.
%C A073779 a(n) = 0 if prime(n) is in A082555. - _Robert Israel_, Dec 28 2018
%H A073779 Robert Israel, <a href="/A073779/b073779.txt">Table of n, a(n) for n = 1..10000</a>
%F A073779 a(n) = A077267(A000040(n)). - _Michel Marcus_, Oct 02 2013
%e A073779 a(10)=2 as 10th prime is 29 in base-10 representation, or 1002 in base-3 representation.
%p A073779 f:= n -> numboccur(0,convert(ithprime(n),base,3)):
%p A073779 map(f, [$1..200]); # _Robert Israel_, Dec 28 2018
%t A073779 A073779[n_] := Length[Cases[IntegerDigits[Prime[n], 3], 0]];
%t A073779 DigitCount[#,3,0]&/@Prime[Range[120]] (* _Harvey P. Dale_, Apr 26 2011 *)
%o A073779 (Magma) [ Multiplicity({* a: a in Intseq(p, 3) *}, 0): p in PrimesUpTo(600) ]; // _Klaus Brockhaus_, Oct 10 2010
%Y A073779 Cf. A073780, A073781, A077267, A082555.
%K A073779 base,easy,nonn
%O A073779 1,10
%A A073779 _Zak Seidov_, Aug 11 2002
%E A073779 More terms from _Klaus Brockhaus_, Oct 10 2010