|
%I #5 Jul 10 2013 15:17:41
%S 1,2,4,10,14,24,30,36,42,48,54,72,80,88,96,120,130,140,150,160,170,
%T 180,190,200,210,246,258,270,282,294,306,350,364,378,392,406,420,472,
%U 488,504,520,536,552,612,630,648,666,684,702,770,790,810,830,850,870
%N Smallest m such that A226390(m) = n.
%C A226390(a(n)) = n and A226390(m) < n for m < a(n).
%H Reinhard Zumkeller, <a href="/A227388/b227388.txt">Table of n, a(n) for n = 1..1000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a227388 = (+ 1) . fromJust . (`elemIndex` a226390_list)
%Y Cf. A227389 (first differences); A014011.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jul 10 2013
|
