A369294 Lexicographically earliest sequence of distinct positive integers such that a(1) = 1, a(2) = 2, a(3) = 3, and for any n > 3, A091255(a(n), a(n-2)) <> 1 and A091255(a(n), a(n-1)) = 1.

1, 2, 3, 4, 5, 8, 9, 16, 7, 6, 21, 10, 35, 12, 13, 14, 23, 22, 15, 11, 17, 44, 27, 26, 29, 28, 33, 32, 31, 18, 155, 20, 81, 24, 127, 30, 49, 34, 69, 36, 173, 40, 19, 39, 38, 43, 42, 25, 45, 50, 51, 52, 53, 56, 57, 62, 63, 64, 65, 74, 71, 37, 46, 251, 48, 79

Offset

1,2

Comments

This sequence is a variant of the Yellowstone permutation (A098550).

Is this a permutation of the positive integers?

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Scatterplot of (n, a(n)) such that n, a(n) <= 25000

Rémy Sigrist, PARI program

Index entries for sequences operating on GF(2)[X]-polynomials

Prog

(PARI) See Links section.

Crossrefs

See A369293 for a similar sequence.

Cf. A091255, A098550.

Sequence in context: A085152 A392740 A264886 * A287117 A286431 A015931

Adjacent sequences: A369291 A369292 A369293 * A369295 A369296 A369297

Keyword

nonn,base

Author

Rémy Sigrist, Jan 18 2024

Status

approved