%I #14 Jan 21 2024 13:54:16

%S 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,

%T 33,32,31,18,155,20,81,24,127,30,49,34,69,36,173,40,19,39,38,43,42,25,

%U 45,50,51,52,53,56,57,62,63,64,65,74,71,37,46,251,48,79

%N 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.

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

%C Is this a permutation of the positive integers?

%H Rémy Sigrist, <a href="/A369294/b369294.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A369294/a369294.png">Scatterplot of (n, a(n)) such that n, a(n) <= 25000</a>

%H Rémy Sigrist, <a href="/A369294/a369294.gp.txt">PARI program</a>

%H <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>

%o (PARI) See Links section.

%Y See A369293 for a similar sequence.

%Y Cf. A091255, A098550.

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Jan 18 2024