This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284549 Lexicographically earliest sequence such that a(0) = 1 and a(n + k) != a(n - k) for all 0 < k <= ceiling(n/a(n)). 1
 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, 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, 12, 8, 8, 3, 11, 7, 2, 2, 1, 9, 10, 12, 4, 1, 5, 4, 3, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(3) = 2 therefore a(4) != a(2) and a(5) != a(1). Note that k = floor(3/2) = 2. LINKS Peter Kagey, Table of n, a(n) for n = 0..10000 Peter Kagey, Haskell program for enumerating A284549. CROSSREFS Cf. A284548. Sequence in context: A191521 A245370 A321341 * A200779 A286558 A023990 Adjacent sequences:  A284546 A284547 A284548 * A284550 A284551 A284552 KEYWORD nonn AUTHOR Peter Kagey, Mar 28 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 26 03:21 EDT 2019. Contains 326324 sequences. (Running on oeis4.)