|
%I #11 Aug 31 2016 20:56:34
%S 0,1,1,1,1,2,2,2,1,2,2,2,1,2,2,2,1,2,1,2,2,2,2,3,3,3,2,3,3,3,2,3,3,3,
%T 2,3,1,2,2,2,2,3,3,3,2,3,3,3,2,3,3,3,2,3,1,2,2,2,2,3,3,3,2,3,3,3,2,3,
%U 3,3,2,3,1,2,2,2,2,3,3,3,2,3,3,3,2,3,3,3,2,3,1,2,2,2,2,3,1,2,2,2,2,3,3,3,2,3,3,3,2,3,3,3,2,3,2,3,3,3,3,4,4
%N Number of nonzero digits in greedy A001563-base representation of n (A276326).
%H Antti Karttunen, <a href="/A276337/b276337.txt">Table of n, a(n) for n = 0..4320</a>
%F a(0) = 0; for n >= 1, a(n) = 1 + a(A276335(n)).
%F For all n >= 0, a(n) <= A276328(n).
%t f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], (# #!) &[# - i]]], {i, 0, # - 1}] &@ NestWhile[# + 1 &, 0, (# #!) &[# + 1] <= n &]; Rest[a][[All, 1]]]; {0}~Join~Table[Count[f@ n, d_ /; d > 0], {n, 120}] (* _Michael De Vlieger_, Aug 31 2016 *)
%o (Scheme, with memoization-macro definec)
%o (definec (A276337 n) (if (zero? n) n (+ 1 (A276337 (A276335 n)))))
%Y Cf. A001536, A276326, A276328, A276335.
%K nonn,base
%O 0,6
%A _Antti Karttunen_, Aug 30 2016
|
