cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A094512 Inverse of A094511.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, May 06 2004

Keywords

Comments

Permutation of the natural numbers: A094511(a(n))=a(A094511(n))=n.

Crossrefs

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a094512 = (+ 1) . fromJust . (`elemIndex` a094511_list)
    -- Reinhard Zumkeller, Nov 23 2014

A094513 A094511(A094511(n)).

Original entry on oeis.org

1, 2, 8, 16, 4, 3, 5, 32, 9, 10, 6, 18, 7, 17, 11, 64, 20, 24, 12, 33, 14, 19, 13, 34, 21, 22, 15, 25, 23, 26, 27, 128, 36, 40, 35, 48, 37, 38, 28, 65, 41, 42, 30, 44, 39, 43, 29, 68, 49, 50, 45, 66, 46, 56, 31, 72, 51, 52, 47, 53, 54, 55, 57, 256, 80, 96, 67, 129, 69, 74
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2004

Keywords

Comments

Permutation of the natural numbers: A094514(a(n))=a(A094514(n))=n;
A094512(a(n))=a(A094512(n))=A094511(n).

Crossrefs

Cf. A094514 (inverse), A094511, A094512.

Programs

A094510 Smallest number distinct from n, not occurring earlier and having in binary representation exactly as many ones as n.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, May 06 2004

Keywords

Comments

a(a(n))=n: a self-inverse permutation of natural numbers.

Crossrefs

Programs

  • Haskell
    import Data.List (delete)
    a094510 n = a094510_list !! (n-1)
    a094510_list = f 1 [1..] where
       f x zs = g zs where
         g (y:ys) = if y /= x && a000120 y == wt
                       then y : f (x + 1) (delete y zs) else g ys
         wt = a000120 x
    -- Reinhard Zumkeller, Nov 23 2014

A094514 A094512(A094512(n)).

Original entry on oeis.org

1, 2, 6, 5, 7, 11, 13, 3, 9, 10, 15, 19, 23, 21, 27, 4, 14, 12, 22, 17, 25, 26, 29, 18, 28, 30, 31, 39, 47, 43, 55, 8, 20, 24, 35, 33, 37, 38, 45, 34, 41, 42, 46, 44, 51, 53, 59, 36, 49, 50, 57, 58, 60, 61, 62, 54, 63, 79, 87, 95, 91, 93, 111, 16, 40, 52, 67, 48, 69, 75
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2004

Keywords

Comments

Permutation of the natural numbers: A094513(a(n))=a(A094513(n))=n.
A094511(a(n))=a(A094511(n))=A094512(n).

Crossrefs

Cf. A094513 (inverse), A094511, A094512.

Programs

Showing 1-4 of 4 results.