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