|
%I #11 Mar 29 2017 20:48:47
%S 1,1,2,2,1,3,3,4,2,1,1,2,4,5,5,6,6,4,3,2,2,1,1,3,7,7,8,8,9,9,2,1,3,3,
%T 4,2,1,5,5,4,6,6,10,10,7,11,9,8,3,2,8,3,4,5,1,1,2,7,10,6,6,4,5,9,11,
%U 12,8,8,3,11,7,2,2,1,9,10,12,4,1,5,4,3,10
%N Lexicographically earliest sequence such that a(0) = 1 and a(n + k) != a(n - k) for all 0 < k <= ceiling(n/a(n)).
%C a(3) = 2 therefore a(4) != a(2) and a(5) != a(1). Note that k = floor(3/2) = 2.
%H Peter Kagey, <a href="/A284549/b284549.txt">Table of n, a(n) for n = 0..10000</a>
%H Peter Kagey, <a href="/A284549/a284549.hs.txt">Haskell program for enumerating A284549</a>.
%Y Cf. A284548.
%K nonn
%O 0,3
%A _Peter Kagey_, Mar 28 2017
|
