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-2 of 2 results.

A095259 Smallest m such that A095258(m) = n.

Original entry on oeis.org

1, 3, 2, 4, 10, 5, 21, 9, 6, 16, 18, 14, 19, 39, 25, 26, 11, 8, 51, 38, 46, 56, 20, 15, 17, 34, 7, 48, 50, 37, 78, 27, 67, 12, 52, 33, 64, 66, 69, 44, 169, 53, 134, 93, 95, 40, 22, 28, 47, 41, 29, 89, 91, 54, 96, 60, 70, 99, 312, 43, 202, 80, 157, 55, 63, 92, 130, 13
Offset: 1

Views

Author

Reinhard Zumkeller, May 31 2004

Keywords

Comments

Inverse of A095258, if the conjecture is true, that this is a permutation: a(A095258(n)) = A095258(a(n)) = n;
A095261(n) = a(a(n)).

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a095259 = (+ 1) . fromJust . (`elemIndex` a095258_list)
    -- Reinhard Zumkeller, Dec 31 2014

Extensions

Revised version: Reinhard Zumkeller, Dec 31 2014

A095260 a(n) = A095258(A095258(n)).

Original entry on oeis.org

1, 2, 3, 4, 9, 8, 32, 11, 18, 6, 25, 26, 99, 34, 235, 5, 15, 17, 68, 94, 27, 49, 241, 243, 24, 10, 102, 28, 19, 10519, 505, 74, 219, 16, 119, 506, 289, 23, 12, 21, 29, 925, 56, 46, 116, 7, 113, 48, 193, 51, 13, 73, 470, 54, 37, 47, 72, 174, 85, 22, 471, 479, 131
Offset: 1

Views

Author

Reinhard Zumkeller, May 31 2004

Keywords

Comments

Integer permutation with inverse A095261: a(A095261(n)) = A095261(a(n)) = n;
A095259(a(n)) = a(A095259(n)) = A095258(n).

Crossrefs

Showing 1-2 of 2 results.