This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247468 Smallest number m such that A247462(m) = n. 3
 1, 5, 164, 501, 7364, 29121, 515504, 2445693 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A247462(a(n)) = n and A247462(m) < n for m < a(n). LINKS EXAMPLE .  n |    a(n) |                  A058977 trajectory . ---+---------+--------------------------------------------------------- .  2 |       5 | 1/a(2)-5/2-7 .  3 |     164 | 1/a(3)-19/3-13/2-4 .  4 |     501 | 1/a(4)-253/2-25/3-9/2-11 .  5 |    7364 | 1/a(5)-499/3-253/2-25/3-9/2-11 .  6 |   29121 | 1/a(6)-14563/2-979/3-493/2-19/3-13/2-4 .  7 |  515504 | 1/a(6)-34375/3-17191/2-535/3-271/2-23/3-15/2-17 .  8 | 2445693 | 1/a(8)-1222849/2-58241/3-14563/2-979/3-493/2-19/3-13/2-4 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a247468 = (+ 1) . fromJust . (`elemIndex` a247462_list) CROSSREFS Cf. A247462, A058977. Sequence in context: A195951 A128068 A197095 * A304056 A305450 A304702 Adjacent sequences:  A247465 A247466 A247467 * A247469 A247470 A247471 KEYWORD nonn,more AUTHOR Reinhard Zumkeller, Sep 17 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 December 12 09:36 EST 2019. Contains 329953 sequences. (Running on oeis4.)