This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095259 Smallest m such that A095258(m) = n. 7
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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)). LINKS PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a095259 = (+ 1) . fromJust . (`elemIndex` a095258_list) -- Reinhard Zumkeller, Dec 31 2014 CROSSREFS Sequence in context: A094962 A084793 A033820 * A260596 A265353 A266189 Adjacent sequences:  A095256 A095257 A095258 * A095260 A095261 A095262 KEYWORD nonn AUTHOR Reinhard Zumkeller, May 31 2004 EXTENSIONS Revised version: Reinhard Zumkeller, Dec 31 2014 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 December 6 16:24 EST 2019. Contains 329808 sequences. (Running on oeis4.)