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!)
 A264647 Smallest number m such that A263856(m) = n. 2
 1, 2, 6, 4, 10, 8, 79, 199, 9, 108, 11, 29, 17, 15, 40, 80, 20, 59, 306, 22, 169, 38, 27, 82, 287, 41, 49, 209, 47, 135, 31, 36, 127, 112, 123, 162, 46, 89, 63, 54, 581, 43, 56, 770, 67, 48, 134, 52, 142, 69, 58, 101, 382, 466, 75, 64, 273, 95, 117, 126, 72 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A263856(a(n)) = n and A263856(m) != n for m < a(n). a(6949) > 22700000 if it exists. - Chai Wah Wu, Feb 01 2016 LINKS Reinhard Zumkeller and Chai Wah Wu, Table of n, a(n) for n = 1..6948 n = 1..391 from Reinhard Zumkeller PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a264647 = (+ 1) . fromJust . (`elemIndex` a263856_list) CROSSREFS Cf. A263856. Sequence in context: A306645 A113571 A119018 * A094748 A245579 A245788 Adjacent sequences:  A264644 A264645 A264646 * A264648 A264649 A264650 KEYWORD nonn AUTHOR Reinhard Zumkeller, Nov 19 2015 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 16 02:41 EDT 2021. Contains 343937 sequences. (Running on oeis4.)