A230598 -id:A230598 - cp's OEIS frontend

A230599 Inverse permutation to A230598.

1, 3, 2, 5, 6, 4, 7, 12, 8, 10, 9, 13, 14, 11, 15, 27, 16, 18, 17, 20, 21, 19, 22, 28, 23, 25, 24, 29, 30, 26, 31, 58, 32, 34, 33, 36, 37, 35, 38, 43, 39, 41, 40, 44, 45, 42, 46, 59, 47, 49, 48, 51, 52, 50, 53, 60, 54, 56, 55, 61, 62, 57, 63, 121, 64, 66, 65

Offset: 1

Paul Tek, Oct 24 2013

a(A230598(n)) = A230598(a(n)) = n, for any n>0.

Cf. A230598.

A240972 Lexicographically earliest sequence such that (i) the binary plot of the sequence is symmetric with respect to the line y=x and (ii) the derived sequence (A000265(a(n))) contains only distinct terms.

Original entry on oeis.org

1, 6, 10, 28, 72, 352, 240, 832, 672, 2432, 17408, 12800, 47104, 55296, 41984, 126976, 950272, 2162688, 2424832, 3211264, 18350080, 5111808, 90177536, 377487360, 55574528, 394264576, 247463936, 3422552064, 578813952, 14763950080

Offset: 1

Paul Tek, Aug 05 2014

The first constraint means that writing the binary representation of each number vertically yields a symmetrical plot about the line y = x (see the binary plot).
The second constraint ensures that the sequence contains only distinct terms, and differs from A000079.
The keywords "nice" and "look" are based on the fact that the binary plot is very interesting. - N. J. A. Sloane, Aug 22 2014

Paul Tek, Table of n, a(n) for n = 1..3313
Paul Tek, Binary plot of the first hundred terms
Paul Tek, Perl program for this sequence
Eric Weisstein's World of Mathematics, Binary Plot

Cf. A230598, A240992 (odd part).

Perl
```
See Link section.
```

cp's OEIS Frontend

A230599 Inverse permutation to A230598.

Views

Author

Keywords

Comments

Links

Crossrefs