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.
%I A108592 #23 Feb 16 2025 08:32:58
%S A108592 6,12,18,25,31,1,37,43,50,56,62,2,69,75,81,87,94,3,100,106,113,119,
%T A108592 125,131,4,138,144,150,157,163,5,169,175,182,188,194,7,201,207,213,
%U A108592 219,226,8,232,238,245,251,257,263,9,270,276,282,289,295,10,301,307,314,320,326,11,333,339,345,351,358,364,13,370
%N A108592 Self-inverse integer permutation induced by Beatty sequences for 2*Pi and 2*Pi/(2*Pi-1).
%H A108592 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>
%H A108592 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%H A108592 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A108592 a(A038130(n))=A108586(n) and a(A108586(n))=A038130(n).
%o A108592 (PARI) a30(n) = floor(n*2*Pi);
%o A108592 a86(n) = floor(2*n*Pi/(2*Pi-1));
%o A108592 lista(nn) = {my(vb = vector(nn, n, a30(n))); my(vc = vector(nn, n, a86(n))); my(va = vector(nn)); for (n=1, nn, if (vb[n] <= nn, va[vb[n]] = vc[n]); if (vc[n] <= nn, va[vc[n]] = vb[n]);); va;} \\ _Michel Marcus_, May 25 2022
%Y A108592 Cf. A108590, A108591, A108593.
%K A108592 nonn,easy
%O A108592 1,1
%A A108592 _Reinhard Zumkeller_, Jun 11 2005
%E A108592 Four terms corrected by _Georg Fischer_ and _Michel Marcus_, May 25 2022