|
%I #17 Nov 09 2018 22:15:47
%S 0,1,2,1,2,3,2,1,2,4,2,2,1,2,5,2,2,2,1,2,3,6,2,3,2,3,2,2,1,2,7,2,2,2,
%T 2,2,1,2,8,2,4,2,2,2,2,2,1,2,3,9,2,3,2,3,2,3,2,3,2,2,2,1,2,4,10,2,5,2,
%U 2,4,2,2,2,2,2,1,2,11,2,2,2,2,2,2,2,2
%N a(n) is the number of terms in row n of irregular table A175327. For n >= 1, a(n) = number of runs (of both 0's and 1's) in the binary representation of A175326(n).
%C a(0) = 0 is the number of terms in the empty list.
%H Rémy Sigrist, <a href="/A175328/b175328.txt">Table of n, a(n) for n = 0..10000</a>
%Y Cf. A175326, A175327.
%K base,nonn
%O 0,3
%A _Leroy Quet_, Apr 07 2010
%E More terms from _Rémy Sigrist_, Nov 08 2018
|
