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 A023133 #19 May 27 2024 11:20:12
%S A023133 1,2,3,4,1,5,2,6,3,7,4,1,8,5,2,9,6,3,10,7,4,1,11,8,5,2,12,9,6,3,13,10,
%T A023133 7,4,1,14,11,8,5,2,15,12,9,6,3,16,13,10,7,4,1,17,14,11,8,5,2,18,15,12,
%U A023133 9,6,3,19,16,13,10,7,4,1,20,17,14,11,8,5,2,21,18,15,12,9,6,3
%N A023133 Signature sequence of Pi (arrange the numbers i+j*x (i,j >= 1) in increasing order; the sequence of i's is the signature of x).
%D A023133 C. Kimberling, "Fractal Sequences and Interspersions", Ars Combinatoria, vol. 45 p 157 1997.
%H A023133 T. D. Noe, <a href="/A023133/b023133.txt">Table of n, a(n) for n=1..1000</a>
%H A023133 C. Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/intersp.html">Interspersions</a>
%H A023133 <a href="/index/Si#signature_sequences">Index entries for sequences related to signature sequences</a>
%o A023133 (PARI) lista(nn) = {v = vector(nn^2, k, kij = k+nn-1; i = 1+(kij % nn); j = kij\nn; i+j*Pi); vs = vecsort(v, , 1); for (k=1, #vs, print1(curi = 1+((vs[k]+nn-1) % nn), ", "); if (curi == nn, break));} \\ _Michel Marcus_, Apr 10 2015
%Y A023133 Cf. A001840, A008810.
%K A023133 nonn
%O A023133 1,2
%A A023133 _Clark Kimberling_