cp's OEIS Frontend

A306230 Lexicographically earliest sequence of distinct positive terms such that for any n > 0, G(n) <> G(a(n)) (where G denotes the Golomb's sequence A001462).

%I A306230 #14 Feb 01 2019 01:20:53
%S A306230 2,1,4,3,6,5,9,10,7,8,12,11,16,17,18,13,14,15,20,19,24,25,26,21,22,23,
%T A306230 29,30,27,28,34,35,36,31,32,33,39,40,37,38,45,46,47,48,41,42,43,44,51,
%U A306230 52,49,50,57,58,59,60,53,54,55,56,63,64,61,62,70,71,72
%N A306230 Lexicographically earliest sequence of distinct positive terms such that for any n > 0, G(n) <> G(a(n)) (where G denotes the Golomb's sequence A001462).
%C A306230 This sequence is a self-inverse permutation of the natural numbers.
%C A306230 For any n > 0, let b(n) = a(n) - n; the sequence b is unbounded.
%H A306230 Rémy Sigrist, <a href="/A306230/b306230.txt">Table of n, a(n) for n = 1..1000</a>
%H A306230 Rémy Sigrist, <a href="/A306230/a306230.gp.txt">PARI program for A306230</a>
%H A306230 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e A306230 The first terms of the sequence, alongside G, are:
%e A306230   n   a(n)  G(n)
%e A306230   --  ----  ----
%e A306230    1     2     1
%e A306230    2     1     2
%e A306230    3     4     2
%e A306230    4     3     3
%e A306230    5     6     3
%e A306230    6     5     4
%e A306230    7     9     4
%e A306230    8    10     4
%e A306230    9     7     5
%e A306230   10     8     5
%e A306230   11    12     5
%e A306230   12    11     6
%e A306230   13    16     6
%e A306230   14    17     6
%e A306230   15    18     6
%e A306230   16    13     7
%e A306230   17    14     7
%e A306230   18    15     7
%e A306230   19    20     7
%e A306230   20    19     8
%o A306230 (PARI) See Links section.
%Y A306230 See A306229 for a similar sequence.
%Y A306230 Cf. A001462.
%K A306230 nonn
%O A306230 1,1
%A A306230 _Rémy Sigrist_, Jan 30 2019