Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #22 Dec 14 2019 15:48:42
%S 1,1,3,4,7,7,15,12,18,16,25,23,14,22,26,33,23,38,32,35,45,49,41,44,58,
%T 49,59,39,49,69,54,57,57,75,79,62,75,76,74,81,75,78,74,90,86,86,88,78,
%U 78,105,106,109,129,91,92,111,108,101,126,130,116,129,133,140
%N a(n) is the number of occurrences of n in A316774.
%C These values may be only conjectural, in which case the b-file should be changed to an a-file and marked as conjectured. - _N. J. A. Sloane_, Dec 14 2019
%H Alois P. Heinz, <a href="/A316973/b316973.txt">Table of n, a(n) for n = 0..5000</a>
%H Altug Alkan, <a href="/A316973/a316973.png">A plot of a(n)-2*n (conjectural)</a>
%F a(n) = |{ j : A316774(j) = n }|.
%e a(4) = 7 because A316774(j) = 4 for j in s = {4,7,12,13,36,49,55} and |s| = 7.
%Y Cf. A316774, A316905, A316984.
%K nonn,look
%O 0,3
%A _Alois P. Heinz_, Jul 17 2018