The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A266118 a(n) = index of n in A266117 or 0 if n is not present in that sequence. 3

%I

%S 1,2,3,4,5,8,9,11,12,6,7,10,14,18,23,22,19,15,16,26,21,20,27,13,31,17,

%T 37,30,28,25,59,24,39,33,70,40,41,48,47,38,35,29,74,44,64,54,53,32,45,

%U 56,49,50,34,36,51,61,62,55,52,57,42,58,66,63,43,60,75,69,68,76,77,46,73,67,85,83,94,78,71,65,89,98,136,79,119,100

%N a(n) = index of n in A266117 or 0 if n is not present in that sequence.

%C It is conjectured that A266117 is not just injective, but also surjective on N, i.e., that it is a true permutation of natural numbers. In that case also this sequence is a true permutation, and no hypothetical zero-values are ever needed.

%H Antti Karttunen, <a href="/A266118/b266118.txt">Table of n, a(n) for n = 1..12634</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%o (Scheme, with code for A266117 defined with defineperm1-macro also required)

%o (define (A266118 n) (A266117 (- n))) ;; This returns inverse values of A266117 from its hidden cache.

%Y Inverse: A266117 (with provisions, see comment section).

%K nonn,base

%O 1,2

%A _Antti Karttunen_, Dec 22 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 09:05 EDT 2021. Contains 347518 sequences. (Running on oeis4.)