A277165 Lexicographically least sequence of nonnegative integers that avoids 27/23-powers.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0

Offset

0

Comments

Even though this sequence is defined on the nonnegative integers, it is actually a sequence on the finite alphabet {0, 1, 2}.

This sequence is 353-automatic.

Links

Eric Rowland, Table of n, a(n) for n = 0..20000

Lara Pudwell and Eric Rowland, Avoiding fractional powers over the natural numbers, arXiv:1510.02807 [math.CO] (2015).

Eric Rowland, List of first 150000 terms

Index entries for automatic sequences.

Formula

a(353 n + 75371) = a(n).

Crossrefs

Sequence in context: A011742 A011741 A369058 * A011740 A354344 A085974

Adjacent sequences: A277162 A277163 A277164 * A277166 A277167 A277168

Keyword

nonn

Author

Eric Rowland, Oct 01 2016

Status

approved