|
| |
|
|
A074293
|
|
Dominant (i.e. most populous) digit in Kolakoski sequence (A000002) when partitioned into groups of 5.
|
|
4
| |
|
|
1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Nathaniel Johnston, Table of n, a(n) for n = 0..10000
|
|
|
EXAMPLE
| The Kolakoski sequence begins (1,2,2,1,1), (2,1,2,2,1), (2,2,1,1,2), (1,1,2,2,1), hence sequence begins 1,2,2,1
|
|
|
MAPLE
| lim:=400: s:=[1, 2, 2]: for n from 3 to lim do for i from 1 to s[n] do s:=[op(s), 1+((n-1)mod 2)]: od: od: lim2:=floor(nops(s)/5)-1: for n from 0 to lim2 do if(s[5*n+1]+s[5*n+2]+s[5*n+3]+s[5*n+4]+s[5*n+5]<=7)then printf("1, "): else printf("2, "): fi: od: # Nathaniel Johnston, May 01 2011
|
|
|
CROSSREFS
| Cf. A074292, A074295.
Sequence in context: A136436 A143331 A167677 * A013949 A078880 A000002
Adjacent sequences: A074290 A074291 A074292 * A074294 A074295 A074296
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Jon Perry (perry(AT)globalnet.co.uk), Sep 21 2002
|
| |
|
|
