login
A192362
a(n) = smallest m such that A131644(m) = n, or -1 if n does not appear in A131644.
4
1, 2, 3, 13, 7, 19, 59474, 7177, 14, 37, 158, 25, 20, 1759, 181, 59, 18, 229, 38, 237, 26, 3301, 358, 49, 76, 29, 34, 75359, 106, 71, 119, 33, 40, 2514233, 542, 3799, 131, 41, 90, 100471, 108, 906095, 47, 57, 74, 4079, 118, 2461, 232, 81, 1146, 1757, 102
OFFSET
0,2
COMMENTS
A131644(a(n)) = n and A131644(m) <> n for m < a(n).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..86
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a192362 = (+ 1) . fromJust . (`elemIndex` a131644_list)
-- Reinhard Zumkeller, Jan 30 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jun 30 2011
EXTENSIONS
Better definition from N. J. A. Sloane, May 06 2014
STATUS
approved