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.

A338347 a(n) = index k such that A338338(k) = n, or -1 if n does not appear in A338338.

This page as a plain text file.
%I A338347 #10 Oct 28 2020 08:10:40
%S A338347 1,2,5,3,7,4,11,10,6,8,19,14,33,12,15,18,38,22,42,9,23,20,54,26,68,32,
%T A338347 27,13,73,16,78,37,28,39,60,35,82,41,34,17,91,24,95,21,44,53,120,36,
%U A338347 90,31,49,64,125,56,29,25,43,72,145,45,152,79,48,81,69,57,157,40,55,46
%N A338347 a(n) = index k such that A338338(k) = n, or -1 if n does not appear in A338338.
%C A338347 There is a strong conjecture that A338338 is a permutation of the positive integers. If that is true, this is the inverse permutation.
%H A338347 Rémy Sigrist, <a href="/A338347/b338347.txt">Table of n, a(n) for n = 1..10000</a>
%H A338347 Rémy Sigrist, <a href="/A338347/a338347.gp.txt">PARI program for A338347</a>
%o A338347 (PARI) See Links section.
%Y A338347 Cf. A338338-A338349.
%K A338347 nonn
%O A338347 1,2
%A A338347 _N. J. A. Sloane_, Oct 27 2020