%I #16 May 25 2015 03:58:51
%S 4,1,1,1,2,2,1,2,2,1,3,2,1,2,2,1,3,2,1,2,2,3,2,1,2,2,2,1,3,2,1,2,2,3,
%T 2,1,2,2,2,1,3,2,2,3,2,1,2,2,2,1,3,2,2,1,2,2,2,3,2,1,2,2,2,1,3,2,2,3,
%U 2,1,2,2,2,1,3,2,2,1,2,2,2,3,2,1,3,2,2,3,2,1,2,2,2,1,3,2,2,1,2
%N a(n) = number of times n occurs in A063882.
%C a(A202016(n)) = 1. [_Reinhard Zumkeller_, Dec 08 2011]
%H N. J. A. Sloane, <a href="/A132157/b132157.txt">Table of n, a(n) for n = 1..200</a> [Taken from the Balamohan et al. reference]
%H B. Balamohan, A. Kuznetsov and S. Tanny, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Tanny/tanny3.html">On the behavior of a variant of Hofstadter's Q-sequence</a>, J. Integer Sequences, Vol. 10 (2007), #07.7.1.
%H <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a>
%o (Haskell)
%o import Data.List (group)
%o a132157 n = a132157_list !! (n-1)
%o a132157_list = (map length) (group a063882_list)
%o -- _Reinhard Zumkeller_, Dec 08 2011
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Nov 06 2007