cp's OEIS Frontend

A118463 Inverse permutation to A118462.

%I A118463 #18 Mar 18 2022 21:51:29
%S A118463 0,1,2,3,4,5,7,10,6,8,11,14,15,19,25,33,9,12,16,20,21,26,34,43,27,35,
%T A118463 44,55,56,70,88,110,13,17,22,28,29,36,45,57,37,46,58,71,72,89,111,137,
%U A118463 47,59,73,90,91,112,138,169,113,139,170,207,208,253,307,371,18,23,30,38,39
%N A118463 Inverse permutation to A118462.
%H A118463 Alois P. Heinz, <a href="/A118463/b118463.txt">Table of n, a(n) for n = 0..12286</a>
%H A118463 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%p A118463 g:= proc(n, i) option remember; `if`(n=0, [0], `if`(i<1, [], [seq(
%p A118463       map(p->p+2^(i-1)*j, g(n-i*j, i-1))[], j=0..min(1, n/i))]))
%p A118463     end:
%p A118463 b:= proc() local l, i; l:=[]; i:=0;
%p A118463       proc(n) while nops(l)<=n do
%p A118463         l:=[l[], sort(g(i, i))[]]; i:=i+1 od; l[n+1]
%p A118463       end
%p A118463     end():
%p A118463 a:= proc() local t, a; t, a:= -1, proc() -1 end;
%p A118463       proc(n) local h;
%p A118463         while a(n) = -1 do
%p A118463           t:= t+1; h:= b(t);
%p A118463           if a(h) = -1 then a(h):= t fi
%p A118463         od; a(n)
%p A118463       end
%p A118463     end():
%p A118463 seq(a(n), n=0..100);  # _Alois P. Heinz_, Sep 06 2014
%Y A118463 Cf. A118462.
%K A118463 base,nonn,look
%O A118463 0,3
%A A118463 _Franklin T. Adams-Watters_, Apr 28 2006