login
Smallest m such that A212306(m) = n.
2

%I #4 May 27 2015 17:41:38

%S 1,3,6,7,10,16,34,23,32,160,18,159,30,63,370,458,42,60,81,79,101,94,

%T 123,100,1528,215,494,522,1037,147,1363,697,178,302,276,1336,212,804,

%U 186,226,267,815,117,125,170,216,312,883,906,360,206,258,311,354,337

%N Smallest m such that A212306(m) = n.

%C A212306(a(n)) = n and A212306(m) != n for m < a(n).

%H Reinhard Zumkeller, <a href="/A258354/b258354.txt">Table of n, a(n) for n = 1..1000</a>

%o (Haskell)

%o import Data.List (elemIndex); import Data.Maybe (fromJust)

%o a258354 = (+ 1) . fromJust . (`elemIndex` a212306_list)

%Y Cf. A212306.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, May 27 2015