login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284532 The lexicographically earliest sequence of positive integers such that a(1) = a(2) = 1 and a(n + k) != a(n - k) for all k <= a(n). 2
1, 1, 2, 2, 3, 3, 1, 4, 3, 1, 2, 4, 1, 2, 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4, 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4, 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4, 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4, 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4, 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Starting with a(15), this sequence enters a twelve term loop: 2, 1, 3, 2, 1, 3, 2, 1, 4, 2, 1, 4.
LINKS
FORMULA
a(k + 12 * i) = a(k) for k >= 15.
EXAMPLE
a(4) = 2 which means that a(4+2) = a(6) != 1 = a(4-2) (because a(4) >= 2).
a(5) = 3 which means that a(5+1) = a(6) != 2 = a(5-1) (because a(5) >= 1).
Therefore a(6) = 3.
CROSSREFS
Cf. A284548.
Sequence in context: A242361 A116464 A346136 * A125585 A327236 A191860
KEYWORD
nonn
AUTHOR
Peter Kagey and Alec Jones, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:47 EDT 2024. Contains 371267 sequences. (Running on oeis4.)