A091412 Lengths of runs in A090822.

2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 3, 2, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 3, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 3, 2, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 2

Offset

1,1

Links

Table of n, a(n) for n=1..99.

F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.

F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [pdf, ps].

Index entries for sequences related to Gijswijt's sequence

Mathematica

Clear[g]; reversed = {g[2] = 1, g[1] = 1}; blocs[len_] := Module[{bloc1, par, pos}, bloc1 = Take[reversed, len]; par = Partition[reversed, len]; pos = Position[par, bloc_ /; bloc != bloc1, 1, 1]; If[pos == {}, Length[par], pos[[1, 1]] - 1]]; g[n_] := g[n] = Module[{g0}, g0 = Table[{blocs[len], len}, {len, 1, Quotient[n - 1, 2]}] // Sort // Last // First; PrependTo[reversed, g0]; g0]; A090822 = Table[g[n], {n, 1, 200}]; A091412 = Length /@ Split[A090822] (* Jean-François Alcover, Oct 07 2013 *)

Crossrefs

Sequence in context: A106394 A325530 A171712 * A106036 A007001 A094917

Adjacent sequences: A091409 A091410 A091411 * A091413 A091414 A091415

Keyword

nonn

Author

N. J. A. Sloane, Mar 04 2004

Status

approved