|
%I #8 Oct 06 2013 14:48:22
%S 1,1,2,2,2,2,1,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%T 3,3,3,3,3,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4
%N k-tuple sizes in A229873.
%C Number k of elements to read from A229873 to obtain the next k-tuple.
%H Carl R. White, <a href="/A229895/b229895.txt">Table of n, a(n) for n = 1..3906</a>
%e The sequence of tuples represented in A229873 begins (1), (2), (1,1), (1,2), (2,1), (2,2), (3), so this sequence begins 1, 1, 2, 2, 2, 2, 1.
%o /* GNU bc */ for(n=1;n<=5;n++)for(k=1;k<=n;k++){if(k==n){t=n^n}else{t=n^k-(n-1)^k};for(i=1;i<=t;i++) print k,","};print "...\n"
%Y Cf. A229873, A229897.
%K nonn,easy
%O 1,3
%A _Carl R. White_, Oct 03 2013
|
