|
%I #13 Feb 23 2015 09:20:49
%S 0,1,1,1,1,3,1,1,1,1,3,3,3,3,1,1,1,1,3,1,1,1,1,1,3,1,3,1,3,3,3,3,1,3,
%T 3,3,3,1,1,1,1,1,1,3,1,3,3,1,1,3,1,1,1,1,3,1,1,3,3,3,5,3,3,3,3,1,3,5,
%U 3,3,3,3,5,5,3,3,3,3,3,3,3,3,1,3,3,3,3,3
%N Number of 1's in base 3 representation of n-th prime.
%H Harvey P. Dale, <a href="/A073780/b073780.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A062756(A000040(n)). - _Michel Marcus_, Oct 02 2013
%e a1(11)=3 as 11th prime, 31, is 1011 in base 3 representation.
%t a1[n_] := Length[Cases[IntegerDigits[Prime[n], 3], 1]]
%t Table[DigitCount[n,3,1],{n,Prime[Range[100]]}] (* _Harvey P. Dale_, Feb 23 2015 *)
%Y Cf. A073779, A073781.
%K base,easy,nonn
%O 1,6
%A _Zak Seidov_ Aug 11 2002
|
