The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241887 Smallest m, such that A065806(m) = n. 3
 1, 10, 3, 5, 15, 9, 7, 97, 12, 280, 18, 114, 31, 37, 19, 16, 23, 58, 90, 21, 26, 32, 82, 40, 72, 104, 68, 35, 33, 48, 87, 47, 412, 107, 66, 41, 70, 38, 49, 797, 1112, 42, 238, 67, 50, 991, 185, 63, 62, 178, 79, 260, 454, 705, 69, 924, 140, 250, 64, 74, 161 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS All integers > 1 occur in A065806, see conjecture of there; A065806(a(n)) = n and A065806(m) <> n for m < a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 2..1000 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a241887 = (+ 1) . fromJust . (`elemIndex` a065806_list) CROSSREFS Cf. A241671. Sequence in context: A224365 A087869 A167764 * A182493 A323763 A316667 Adjacent sequences:  A241884 A241885 A241886 * A241888 A241889 A241890 KEYWORD nonn AUTHOR Reinhard Zumkeller, Aug 09 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 May 30 05:35 EDT 2020. Contains 334712 sequences. (Running on oeis4.)