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.

A072787 Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A072734 as the packing bijection N X N -> N.

This page as a plain text file.
%I A072787 #5 May 01 2014 02:47:43
%S A072787 0,1,3,2,6,5,13,8,4,14,10,36,20,9,25,19,24,11,12,18,38,16,7,44,27,209,
%T A072787 77,21,105,66,104,28,35,65,230,54,15,34,33,75,43,26,85,50,40,37,22,31,
%U A072787 191,67,23,51,41,69,107,68,49,92,30,29,32,56,211,46,17,299,120,5671
%N A072787 Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A072734 as the packing bijection N X N -> N.
%C A072787 This ranking scheme condenses the structures of the same size (cf. A072789) somewhat better than scheme presented in A072656 (which uses the N X N -> N bijection A072793). Compare the sequences A072790 and A072640 giving the max positions where the last structure with size n will occur in these orderings and the respective binary widths A072791 & A072642. However, by using the second or third power of the bijection A072734 one gets even better results in a certain range.
%H A072787 A. Karttunen, <a href="http://www.iki.fi/~kartturi/matikka/Nekomorphisms/gatomorf.htm">Gatomorphisms</a>
%H A072787 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%o A072787 (Scheme functions below show the essential idea. For a complete source, follow the "Gatomorphisms" link.)
%o A072787 (define A072787 (lexrank->arithrank-bijection packA072734))
%o A072787 (define (lexrank->arithrank-bijection packfun) (lambda (n) (rank-bintree (binexp->parenthesization (A014486 n)) packfun)))
%o A072787 (define (rank-bintree bt packfun) (cond ((not (pair? bt)) 0) (else (1+ (packfun (rank-bintree (car bt) packfun) (rank-bintree (cdr bt) packfun))))))
%Y A072787 Inverse permutation: A072788. Cf. also A014486, A072734, A072789.
%K A072787 nonn
%O A072787 0,3
%A A072787 _Antti Karttunen_, Jun 12 2002