|
%I #15 Nov 11 2022 14:59:11
%S 5,5,1,5,2,1,1,5,3,1,3,2,1,5,4,1,5,2,2,3,2,5,6,1,6,2,5,3,3,4,1,5,8,1,
%T 8,2,6,3,5,4,2,6,2,5,10,1,9,2,9,3,6,4,3,6,4,8,2,5,11,1,10,2,11,3,8,4,
%U 5,6,6,8,3,10,1,9,2,5,13,1,12,2,13,3,10,4,6,6
%N Cumulative counting sequence: method B (noun,adjective)-pairs with first term 5.
%C Segments (generated as at A055168): 5; 5,1; 5,2,1,1; 5,3,1,3,2,1; ...
%C Conjecture: every positive integer occurs.
%H Seiichi Manyama, <a href="/A055183/b055183.txt">Table of n, a(n) for n = 1..10000</a>
%e Write 5, thus having 5 once, thus having 5 twice and 1 once, thus having 5 3 times and 1 3 times and 2 once, etc.
%t s = {5}; 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
|
