|
%I #11 Jan 17 2018 17:50:03
%S 2,0,5,6,465,7,16,208,37,17,11,58,40,35,84,18,45,29,395,30,68,59,41,
%T 62,32,191,325,109,369,33,89,72,36,85,42,47,64,51,101,88,77,49,125,
%U 394,1124,249,76,50,54,65,119,74,2193,61,483,133,80,186,95,990,468
%N Smallest number m such that A096535(m) = n.
%C A096535(a(n)) = n and A096535(m) <> n for m < a(n), concerning first conjecture in A096535.
%H Reinhard Zumkeller, <a href="/A197877/b197877.txt">Table of n, a(n) for n = 0..9999</a>
%e a(0) = A096274(1) = 2; a(1) = A132678(1) = 0.
%o (Haskell)
%o import Data.List (elemIndex)
%o import Data.Maybe (fromJust)
%o a197877 n = a197877_list !! n
%o a197877_list = map (fromJust . (`elemIndex` a096535_list)) [0..]
%K nonn
%O 0,1
%A _Reinhard Zumkeller_, Oct 19 2011
|
