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 A263327 #24 Mar 31 2025 11:30:50
%S A263327 0,1,2,4,8,16,32,64,128,256,512,3,5,6,9,10,12,17,18,20,24,33,34,36,40,
%T A263327 48,65,66,68,72,80,96,129,130,132,136,144,160,192,257,258,260,264,272,
%U A263327 288,320,384,513,514,516,520,528,544,576,640,768,7,11,13,14
%N A263327 A permutation of {0, 1, ..., 1023} corresponding to lexicographical ordering A262557 of numbers with decreasing digits A009995.
%C A263327 For n = 1..1023, A262557(a(n)) = A009995(n).
%C A263327 Cycle type = (1^12, 3^2, 10^2, 74, 912), i.e., this permutation has 12 fixed points, two 3-cycles and two 10-cycles, and two more cycles of length 74 and 912. See A263355 for the list of these cycles, A263383 for the length of the n-th cycle (ordered by increasing largest element).
%H A263327 Reinhard Zumkeller, <a href="/A263327/b263327.txt">Table of n, a(n) for n = 0..1023</a>
%t A263327 SortBy[Range[0, 1023], DigitCount[#, 2, 1] &] (* _Paolo Xausa_, Mar 31 2025 *)
%o A263327 (Haskell)
%o A263327 a263327 0 = 0
%o A263327 a263327 n = head [x | x <- [1..1023], a262557 x == a009995' n]
%o A263327 (PARI) A263327=vecsort(A262557,,1) \\ Does not include a(0)=0. - _M. F. Hasler_, Dec 11 2019
%Y A263327 Cf. A009995, A262557, A263328 (inverse), A263329 (fixed points), A263383, A263355 (cycles).
%Y A263327 Row 10 of A294648.
%K A263327 nonn,fini,full
%O A263327 0,3
%A A263327 _Reinhard Zumkeller_, Oct 15 2015
%E A263327 Edited by _M. F. Hasler_, Dec 11 2019