login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338060 a(n) = m such that A338059(m) = n, or -1 if n does not appear in A338059. 3

%I #4 Oct 18 2020 22:25:23

%S 1,2,5,3,8,4,11,13,6,19,17,14,29,12,7,20,34,21,38,26,22,25,41,51,9,30,

%T 15,31,58,47,64,36,16,35,10,55,73,37,28,43,79,46,92,61,27,42,97,90,23,

%U 60,33,66,133,95,18,50,39,70,136,85,139,65,32,75,44,100,144,76,40,69

%N a(n) = m such that A338059(m) = n, or -1 if n does not appear in A338059.

%C It is conjectured that A338059 is a permutation of the positive numbers. This is (conjecturally) the inverse permutation.

%Y Cf. A336957, A338059.

%K nonn

%O 1,2

%A _Scott R. Shannon_ and _N. J. A. Sloane_, Oct 18 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)