login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A074292
Dominant digit in successive groups of 3 from the Kolakoski sequence (A000002).
7
2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1
OFFSET
1,1
COMMENTS
This appears to be the same as a sequence studied by Claude Lenormand in a letter dated Nov 17 2003: break up the Kolakoski sequence (A000002) into runs of identical symbols and omit one symbol from each run.
The sequence studied by Claude Lenormand is A156257 and is not equal to this one: see A248805 = A156257 - A074292. Differences between the two sequences are at n = 47, 48, 56, 57, 128, 129, 137, 139, 147, 148, 176, 177,... - Jean-Christophe Hervé, Oct 11 2014
As in the Kolakoski sequence, runs in this sequence are of length 1 or 2, because a run XX implies the repetition of exactly the same 3-group in the Kolakoski sequence: -YXX-YXX- or -XXY-XXY- or -XYX-XYX-, and this is not possible 3 times. However, words of the form YXYXY appear in this sequence, but don't appear in the Kolakoski sequence. - Jean-Christophe Hervé, Oct 12 2014
LINKS
Claude Lenormand, Deux transformations sur les mots, Preprint, 5 pages, Nov 17 2003. Apparently unpublished. This is a scanned copy of the version that the author sent to me in 2003. - N. J. A. Sloane, Oct 02 2018
FORMULA
a(n)=A000002(3n-2)+A000002(3n-1)+A000002(3n)-3. - Benoit Cloitre, Nov 15 2003
EXAMPLE
Kolakoski begins (1,2,2), (1,1,2), (1,2,2), (1,2,2), so this begins 2,1,2,2.
MAPLE
A074292 := proc(n)
A000002(3*n-2)+A000002(3*n-1)+A000002(3*n)-3 ;
end proc:
seq(A074292(n), n=1..50) ; # R. J. Mathar, Nov 15 2014
MATHEMATICA
OK = {1, 2, 2}; Do[OK = Join[OK, {1+Mod[n-1, 2]}], {n, 3, 1000}, {OK[[n]]}]; If[Count[#, 1] > 1, 1, 2]& /@ Partition[OK, 3] (* Jean-François Alcover, Nov 13 2014 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Jon Perry, Sep 21 2002
EXTENSIONS
More terms from Ray Chandler, Nov 16 2003
Offset corrected by Jean-Christophe Hervé, Oct 11 2014
STATUS
approved