The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186712 Smallest number m such that A186711(m) = A003586(n). 3
1, 4, 7, 8, 10, 17, 18, 14, 22, 23, 25, 26, 28, 29, 31, 32, 34, 35, 36, 38, 39, 41, 42, 43, 45, 46, 93, 94, 50, 51, 53, 54, 104, 105, 58, 59, 111, 112, 63, 116, 117, 67, 68, 123, 124, 72, 128, 129, 131, 132, 78, 136, 137, 82, 141, 142, 144, 145, 88, 149, 150, 152, 153, 155, 156, 158, 159, 99, 163, 164, 166, 167, 169, 170, 172, 173, 175, 176, 178, 179 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A186711(a(n)) = A003586(n) and A186711(m) != A003586(n) for m < a(n).
LINKS
EXAMPLE
n = 10: A003586(10) = 18 and A186711(23) = 18 with no preceding occurrences of 18 in A186711.
MAPLE
A186712 := proc(n) for m from 1 do if A186711(m) = A003586(n) then return m; end if; end do: end proc: # R. J. Mathar, Mar 04 2011
PROG
(Haskell)
import Data.List (findIndex); import Data.Maybe (fromJust)
a186712 n = (+ 1) $ fromJust $ findIndex (== a003586 n) a186711_list
CROSSREFS
Sequence in context: A286401 A084791 A310933 * A001494 A092214 A319926
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Feb 26 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 13 03:56 EDT 2024. Contains 373366 sequences. (Running on oeis4.)