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.

A360434 a(n) is the greatest number k not yet in the sequence such that A022290(n) = A022290(k).

This page as a plain text file.
%I A360434 #13 Mar 30 2023 16:43:34
%S A360434 0,1,2,4,3,5,8,9,6,7,10,16,12,17,18,20,11,13,14,19,15,21,32,33,24,25,
%T A360434 34,36,35,37,40,41,22,23,26,28,27,29,38,39,30,31,42,64,48,65,66,68,44,
%U A360434 49,50,67,52,69,72,73,70,71,74,80,76,81,82,84,43,45,46,51
%N A360434 a(n) is the greatest number k not yet in the sequence such that A022290(n) = A022290(k).
%C A360434 This sequence is a self-inverse permutation of the nonnegative integers.
%H A360434 Rémy Sigrist, <a href="/A360434/b360434.txt">Table of n, a(n) for n = 0..10922</a>
%H A360434 Rémy Sigrist, <a href="/A360434/a360434.gp.txt">PARI program</a>
%H A360434 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A360434 a(A345101(n, k)) = A345101(n, A000119(n) + 1 - k).
%F A360434 a(A003754(n+1)) = A003714(n).
%F A360434 a(A003714(n)) = A003754(n+1).
%e A360434 There are three numbers k such that A022290(k) = 11: 15, 19, 20,
%e A360434 - so a(15) = 20,
%e A360434      a(19) = 19,
%e A360434      a(20) = 15.
%o A360434 (PARI) See Links section.
%Y A360434 See A360415 for a similar sequence.
%Y A360434 Cf. A000119, A003714, A003754, A022290, A345101.
%K A360434 nonn,base
%O A360434 0,3
%A A360434 _Rémy Sigrist_, Feb 07 2023