|
%I #10 Nov 08 2016 20:23:31
%S 0,0,0,0,0,0,1,1,1,1,1,1,0,2,0,2,0,2,1,0,1,0,1,0,0,1,0,1,0,1,1,2,1,2,
%T 1,2,0,0,0,0,0,3,1,1,1,1,1,0,0,2,0,2,0,1,1,0,1,0,1,2,0,1,0,1,0,0,1,2,
%U 1,2,1,1,0,0,0,0,0,2,1,1,1,1,1,3,0,2,0,2,0,0,1,0,1,0,1,1,0,1,0,1,0,2,1,2,1,2,1,0,0,0,0,0,0,1,1,1,1,1,1,2
%N Lexicographically least sequence of nonnegative integers that avoids 7/6-powers.
%C This sequence is conjecturally 41190-regular.
%H Eric Rowland, <a href="/A277150/b277150.txt">Table of n, a(n) for n = 0..20000</a>
%H Lara Pudwell and Eric Rowland, <a href="http://arxiv.org/abs/1510.02807">Avoiding fractional powers over the natural numbers</a>, arXiv:1510.02807 [math.CO] (2015).
%H Eric Rowland, <a href="/A277150/a277150.txt">List of first 400000 terms</a>
%F Conjecture: a(41190 n + 41201) = a(n) + 3.
%K nonn
%O 0,14
%A _Eric Rowland_, Oct 01 2016
|
