A284548 Lexicographically earliest sequence such that a(0) = 1 and a(n + k) != a(n - k) for all 0 < k <= floor(n/a(n)).

1, 1, 2, 2, 1, 1, 3, 3, 4, 2, 2, 1, 1, 4, 5, 5, 6, 2, 2, 3, 3, 6, 4, 7, 7, 8, 1, 1, 2, 2, 3, 3, 5, 4, 6, 5, 8, 9, 9, 8, 7, 3, 3, 4, 1, 1, 2, 2, 4, 6, 10, 7, 11, 10, 5, 11, 1, 2, 2, 1, 7, 5, 4, 4, 6, 3, 3, 9, 8, 12, 9, 6, 12, 13, 13, 1, 2, 7, 10, 3, 1, 8, 11

Offset

0,3

Links

Peter Kagey, Table of n, a(n) for n = 0..10000

Example

a(7) = 3 therefore a(8) != a(6) and a(9) != a(5). Note that k = floor(7/3) = 2.

Crossrefs

Cf. A284532.

Sequence in context: A352744 A347967 A090706 * A228371 A176971 A247917

Adjacent sequences: A284545 A284546 A284547 * A284549 A284550 A284551

Keyword

nonn

Author

Peter Kagey and Alec Jones, Mar 28 2017

Status

approved