|
%I #18 Mar 10 2017 08:56:03
%S 1,3,1,1,1,2,1,3,1,1,3,1,1,1,2,1,1,3,1,1,2,1,1,2,1,3,1,1,1,2,1,1,2,1,
%T 3,1,1,3,1,1,1,2,1,3,1,1,2,1,1,2,1,1,3,1,1,3,1,1,1,2,1,3,1,1,3,1,1,1,
%U 2,1,1,2,1,3,1,1,2,1,1,3,1,1,3,1,1,1,2,1,3,1,1,3,1,1,1,2,1,1,3,1,1,2,1,1,2
%N Quet transform (see A101387 for definition) of Kolakoski sequence A000002.
%C Can be obtained from A000002 by replacing each 2,2 with 3,1.
%H Lars Blomberg, <a href="/A100808/b100808.txt">Table of n, a(n) for n = 1..10000</a>
%H David Wasserman, <a href="/A100661/a100661.txt">Quet transform + PARI code</a> [Cached copy]
%Y Cf. A000002, A100661, A101387.
%K easy,nonn
%O 1,2
%A _David Wasserman_, Jan 12 2005
|
