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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202014 Smallest m such that A063882(m) = n. 2
 1, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18, 21, 23, 24, 26, 28, 29, 32, 34, 35, 37, 39, 42, 44, 45, 47, 49, 51, 52, 55, 57, 58, 60, 62, 65, 67, 68, 70, 72, 74, 75, 78, 80, 82, 85, 87, 88, 90, 92, 94, 95, 98, 100, 102, 103, 105, 107, 109, 112, 114, 115, 117, 119 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A063882(a(n)) = n and A063882(m) < n for m < a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) import Data.List (elemIndex) import Data.Maybe (fromJust) a202014 n = (fromJust \$ elemIndex n a063882_list) + 1 CROSSREFS Sequence in context: A292917 A120182 A037361 * A319266 A263093 A115839 Adjacent sequences:  A202011 A202012 A202013 * A202015 A202016 A202017 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 08 2011 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 December 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)