cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A338060 #4 Oct 18 2020 22:25:23
%S A338060 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 A338060 15,31,58,47,64,36,16,35,10,55,73,37,28,43,79,46,92,61,27,42,97,90,23,
%U A338060 60,33,66,133,95,18,50,39,70,136,85,139,65,32,75,44,100,144,76,40,69
%N A338060 a(n) = m such that A338059(m) = n, or -1 if n does not appear in A338059.
%C A338060 It is conjectured that A338059 is a permutation of the positive numbers. This is (conjecturally) the inverse permutation.
%Y A338060 Cf. A336957, A338059.
%K A338060 nonn
%O A338060 1,2
%A A338060 _Scott R. Shannon_ and _N. J. A. Sloane_, Oct 18 2020