The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 2
 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, 29, 30, 27, 28, 34, 35, 36, 31, 32, 33, 39, 40, 37, 38, 45, 46, 47, 48, 41, 42, 43, 44, 51, 52, 49, 50, 57, 58, 59, 60, 53, 54, 55, 56, 63, 64, 61, 62, 70, 71, 72 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This sequence is a self-inverse permutation of the natural numbers. For any n > 0, let b(n) = a(n) - n; the sequence b is unbounded. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..1000 Rémy Sigrist, PARI program for A306230 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 PROG (PARI) See Links section. CROSSREFS See A306229 for a similar sequence. Cf. A001462. Sequence in context: A320283 A232805 A073672 * A071065 A328654 A035552 Adjacent sequences:  A306227 A306228 A306229 * A306231 A306232 A306233 KEYWORD nonn AUTHOR Rémy Sigrist, Jan 30 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 28 15:08 EDT 2021. Contains 346335 sequences. (Running on oeis4.)