login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A258765
Smallest m such that |A258057(m)| = n.
2
0, 1, 98, 3, 5, 25, 8, 34, 13, 44, 325, 7, 22, 86, 20, 11, 74, 1910, 62, 122, 17, 4563, 254, 19, 15, 50, 117, 7174, 385, 177, 29, 16, 61, 69, 24, 213, 51, 118, 73, 56601, 41, 121, 82, 23, 866, 9025, 68, 43, 35, 142, 135, 5005, 39, 77, 106, 52, 174, 5865, 70
OFFSET
0,3
COMMENTS
|A258057(a(n))| = n and |A258057(m)| != n for m < a(n).
LINKS
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a258765 = fromJust . (`elemIndex` (map abs a258057_list))
CROSSREFS
Sequence in context: A145309 A122128 A114430 * A033418 A120310 A129887
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jun 10 2015
STATUS
approved