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.

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

This page as a plain text file.
%I A360415 #11 Feb 08 2023 14:47:34
%S A360415 0,1,3,2,4,9,6,10,12,5,7,11,8,13,27,18,28,30,15,19,29,21,31,36,33,37,
%T A360415 39,14,16,20,17,22,32,24,34,38,23,25,35,26,40,81,54,82,84,45,55,83,57,
%U A360415 85,90,87,91,93,42,46,56,48,58,86,63,88,92,60,64,89,66,94
%N A360415 a(n) is the greatest number k not yet in the sequence such that A065361(n) = A065361(k).
%C A360415 This sequence is a self-inverse permutation of the nonnegative integers.
%H A360415 Rémy Sigrist, <a href="/A360415/b360415.txt">Table of n, a(n) for n = 0..9841</a>
%H A360415 Rémy Sigrist, <a href="/A360415/a360415.gp.txt">PARI program</a>
%H A360415 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A360415 a(A360413(n, k)) = A360413(n, A002487(n) + 1 - k).
%F A360415 a(A032924(n)) = A005836(n+1) for any n > 0.
%F A360415 a(A005836(n+1)) = A032924(n) for any n > 0.
%e A360415 There are four numbers k such that A065361(k) = 8: 14, 15, 18, 27,
%e A360415 - so a(14) = 27,
%e A360415      a(15) = 18,
%e A360415      a(18) = 15,
%e A360415      a(27) = 14.
%o A360415 (PARI) See Links section.
%Y A360415 See A360434 for a similar sequence.
%Y A360415 Cf. A002487, A005836, A032924, A065361, A360413.
%K A360415 nonn,base
%O A360415 0,3
%A A360415 _Rémy Sigrist_, Feb 06 2023