A192362 a(n) = smallest m such that A131644(m) = n, or -1 if n does not appear in A131644.

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

Cf. A131644, A241582, A241583.

Sequence in context: A087568 A087564 A306431 * A057776 A110362 A074478

Adjacent sequences: A192359 A192360 A192361 * A192363 A192364 A192365

Keyword

nonn

Author

Reinhard Zumkeller, Jun 30 2011

Extensions

Better definition from N. J. A. Sloane, May 06 2014

Status

approved