login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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: A128369 A087568 A087564 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 15:25 EST 2016. Contains 278781 sequences.