|
|
A229895
|
|
k-tuple sizes in A229873.
|
|
3
|
|
|
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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Number k of elements to read from A229873 to obtain the next k-tuple.
|
|
LINKS
|
|
|
EXAMPLE
|
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.
|
|
PROG
|
/* 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"
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|