

A270647


The sequence a of 1's and 2's starting with (2,2,1,2) such that a(n) is the length of the (n+3)rd run of a.


2



2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

offset 1 bfile10000 is ready
See A270641 for a guide to related sequences.


LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000


EXAMPLE

a(1) = 2, so the 4th run has length 2, so a(5) must be 1 and a(6) = 1.
a(2) = 2, so the 5th run has length 2, so a(7) = 2 and a(8) = 2.
a(3) = 1, so the 6th run has length 1, so a(9) = 1 and a(10) = 2.
Globally, the runlength sequence of a is 2,1,1,2,2,1,2,1,1,2,2,1,2,2,1,2,1,1,2,..., and deleting the first 3 terms leaves a = A270647.


MATHEMATICA

a = {2, 2, 1, 2}; Do[a = Join[a, ConstantArray[If[Last[a] == 1, 2, 1], {a[[n]]}]], {n, 200}]; a (* Peter J. C. Moses, Apr 01 2016 *)


CROSSREFS

Cf. A000002, A006928, A022300, A270641.
Sequence in context: A317960 A270642 A270643 * A261126 A097456 A164002
Adjacent sequences: A270644 A270645 A270646 * A270648 A270649 A270650


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Apr 07 2016


STATUS

approved



