|
%I #7 Nov 11 2020 08:59:22
%S 1,2,2,2,2,1,1,2,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,
%T 1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,
%U 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N Apply Lenormand's "raboter" operation to A306211.
%C The operation shortens each run of consecutive equal terms by one term (runs of length 1 vanish).
%H Rémy Sigrist, <a href="/A323827/b323827.txt">Table of n, a(n) for n = 1..16502</a>
%H Claude Lenormand, <a href="/A318921/a318921.pdf">Deux transformations sur les mots</a>, Preprint, 5 pages, Nov 17 2003. Apparently unpublished. This is a scanned copy of the version that the author sent to me in 2003.
%H Rémy Sigrist, <a href="/A323827/a323827.gp.txt">PARI program for A323827</a>
%o (PARI) See Links section.
%Y Cf. A306211, A318921.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Feb 01 2019
%E More terms from _Rémy Sigrist_, Nov 11 2020
|
