%I #21 Jun 03 2018 03:45:26
%S 1,1,1,1,1,0,2,1,1,1,0,1,2,1,2,1,1,1,0,2,0,0,0,1,2,2,0,2,2,1,2,1,1,1,
%T 1,2,1,0,1,2,1,0,0,0,1,0,1,1,2,2,1,3,1,0,1,2,2,2,1,2,2,1,2,1,1,1,1,2,
%U 1,0,1,2,2,0,0,0,2,0,2,2,1,0,0,0,0,0,0
%N a(n) is the number of occurrences of n in A226062.
%H Antti Karttunen, <a href="/A227752/b227752.txt">Table of n, a(n) for n = 0..319</a>
%F In the following formula [] stands for Iverson brackets. Essentially we are just naively counting the integers which A226062 maps to n. A000225 is the guaranteed upper limit for the runlength codes for the partitions of size n:
%F a(n) = Sum_{i=0..A000225(A227183(n))} [A226062(i)==n].
%F a(n) = Sum_{i=A227368(A227183(n))..A000225(A227183(n))} [A226062(i)==n]. [This is slightly faster if somebody invents a clever formula for the lower limit A227368.]
%o (Scheme, a naive implementation which always begins search from zero)
%o (definec (A227752 n) (add (lambda (k) (if (= n (A226062 k)) 1 0)) 0 (A000225 (A227183 n))))
%o ;; The following function implements sum_{i=lowlim..uplim} intfun(i)
%o (define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i)))))))
%Y A227753 gives the positions of zeros.
%K nonn
%O 0,7
%A _Antti Karttunen_, Jul 26 2013