The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247095 Smallest number m such that A250030(m) = n. 2
 8, 7, 6, 5, 13, 30, 29, 157, 317, 626, 3095, 6637, 26833, 145687, 461938, 1068037, 16007153, 54690697 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA A250030(a(n)) = n and A250030(m) != n for m < a(n). PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a247095 = (+ 5) . fromJust . (`elemIndex` a250030_list) (PARI) A008474(n)=my(f=factor(n)); sum(i=1, #f~, f[i, 1]+f[i, 2]); f(n)=my(k); while(n!=5, n=A008474(n); k++); k; \\ A250030 a(n) = my(k=5); while(f(k) != n, k++); k; \\ Michel Marcus, Feb 05 2022 CROSSREFS Cf. A008474, A250030. Sequence in context: A212410 A328759 A132037 * A124597 A347903 A214023 Adjacent sequences: A247092 A247093 A247094 * A247096 A247097 A247098 KEYWORD nonn,more AUTHOR Reinhard Zumkeller, Nov 18 2014 EXTENSIONS a(17)-a(18) from Michel Marcus, Feb 05 2022 STATUS approved

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

Last modified November 26 14:22 EST 2022. Contains 358362 sequences. (Running on oeis4.)