|
%I #16 Nov 11 2022 14:59:25
%S 2,2,1,2,2,1,1,2,4,1,3,2,5,1,4,4,1,3,1,2,6,1,7,4,3,3,2,5,1,2,8,1,9,4,
%T 4,3,4,5,2,6,1,7,1,2,10,1,12,4,7,3,5,5,3,6,2,7,2,8,1,9,1,2,13,1,15,4,
%U 8,3,7,5,5,6,3,7,4,8,2,9,2,10,1,12,1,2,16,1,18
%N Cumulative counting sequence: method B (noun,adjective)-pairs with first term 2.
%C Segments (generated as at A055168): 2; 2,1; 2,2,1,1; 2,4,1,3,2,5; ...
%C Conjecture: every positive integer occurs.
%H Seiichi Manyama, <a href="/A055174/b055174.txt">Table of n, a(n) for n = 1..10000</a>
%e Write 2, thus having 2 once, thus having 2 twice and 1 once, thus having 2 4 times and 1 3 times and 2 5 times, etc.
%t s = {2}; Do[s = Flatten[{s, {#,Count[s, #]} & /@ DeleteDuplicates[s]}], {24}]; s (* _Peter J. C. Moses_, Mar 21 2013 *)
%Y Cf. A055168.
%K nonn
%O 1,1
%A _Clark Kimberling_, Apr 27 2000
|
