A186712 Smallest number m such that A186711(m) = A003586(n).

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

Offset

1,2

Comments

A186711(a(n)) = A003586(n) and A186711(m) != A003586(n) for m < a(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

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

Cf. A003586, A186711.

Sequence in context: A286401 A084791 A310933 * A001494 A092214 A319926

Adjacent sequences: A186709 A186710 A186711 * A186713 A186714 A186715

Keyword

nonn

Author

Reinhard Zumkeller, Feb 26 2011

Status

approved