|
%I #6 Jan 02 2016 04:07:59
%S 1,5,2,4,3,10,8,6,7,17,13,9,14,11,21,16,20,35,24,15,41,29,27,12,26,18,
%T 25,23,37,30,32,34,33,50,53,36,52,77,22,19,60,65,46,31,39,95,38,28,43,
%U 63,47,40,48,78,42,76,59,71,54,81,45,86,74,51,73,117,109,111,110,83,80,70,113,145,55,79,151,82,101,49
%N a(n) = index of n in A266121 or 0 if n is not present in that sequence.
%C If A266121 is really a permutation of natural numbers, then this sequence is also, and no hypothetical zero-values are ever needed.
%H Antti Karttunen, <a href="/A266122/b266122.txt">Table of n, a(n) for n = 1..8189</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%o (Scheme, with code for A266121 defined with defineperm1-macro also required)
%o (define (A266122 n) (A266121 (- n))) ;; This returns inverse values of A266121 from its hidden cache.
%Y Inverse: A266121 (with provisions, see comment section).
%K nonn,base
%O 1,2
%A _Antti Karttunen_, Dec 23 2015
|
