|
%I #13 Aug 14 2018 09:00:18
%S 1,0,1,0,2,1,2,2,2,1,4,2,3,1,4,1,3,2,2,0,2,1,3,2,3,4,3,3,2,1,4,2,5,3,
%T 2,1,3,2,5,0,2,1,4,2,4,4,3,4,4,2,4,1,3,3,4,4,5,5,4,1,2,2,2,1,2,2,3,3,
%U 3,2,6,3,4,1,3,3,4,3,4,2,4,4,5,3,3,2,3,2,3,2,6,2,3,2,5,2,4,4,4,1
%N Number of odd digits in n^3.
%H G. C. Greubel, <a href="/A104640/b104640.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A196564(n^3). - _Michel Marcus_, Oct 05 2013
%t Table[Count[IntegerDigits[n^3],_?OddQ],{n,100}] (* _Harvey P. Dale_, Jun 23 2017 *)
%o (PARI) a(n) = my(d = digits(n^3)); sum(i=1, #d, d[i] % 2); \\ _Michel Marcus_, Oct 05 2013
%Y Cf. A104639, A196564.
%K easy,nonn,base
%O 1,5
%A _Zak Seidov_, Mar 18 2005
|
