|
%I #9 Feb 17 2016 15:04:38
%S 1,3,2,10,7,4,17,9,6,27,19,11,24,16,8,86,21,5,65,26,18,57,31,88,62,23,
%T 15,80,54,28,98,85,20,46,33,12,77,64,25,38,95,82,69,56,30,113,100,87,
%U 74,61,22,118,35,14,149,79,66,53,123,40,110,97,84,273,71,58,128,45,32,203,102,89,146,76,63
%N Position of n in A268642 (or, inverse permutation to A268642).
%C Apparently there is a claim that A268642 contains every positive integer exactly once, so this sequence is well-defined.
%H N. J. A. Sloane, <a href="/A268531/b268531.txt">Table of n, a(n) for n = 1..945</a>
%p # Let b1 be a list of the initial terms of A268642
%p ans:=[];
%p for n from 1 to nops(b1) do
%p if member(n,b1,'p') then ans:=[op(ans),p];
%p else lprint("missed", n); break; fi;
%p od;
%p ans;
%Y Cf. A268642.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Feb 17 2016
|
