STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A306230
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
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).
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
LINKS
Rémy Sigrist, <a href="/A306230/b306230.txt">Table of n, a(n) for n = 1..1000</a>
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
LINKS
<a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
<a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
STATUS
proposed
editing
STATUS
editing
proposed
COMMENTS
For any n > 0, let b(n) = a(n) - n; the sequence b is unbounded.
EXAMPLE
The first terms of the sequence, alongside G, are:
n a(n) G(n)
-- ---- ----
1 2 1
2 1 2
3 4 2
4 3 3
5 6 3
6 5 4
7 9 4
8 10 4
9 7 5
10 8 5
11 12 5
12 11 6
13 16 6
14 17 6
15 18 6
16 13 7
17 14 7
18 15 7
19 20 7
20 19 8