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 A123494 #8 Dec 13 2015 23:07:47 %S A123494 0,1,2,3,4,8,6,7,5,9,22,20,21,10,14,19,16,17,13,15,11,12,18,23,64,62, %T A123494 63,24,54,61,57,58,27,55,25,26,59,37,60,53,56,38,42,51,44,45,36,41,34, %U A123494 35,46,43,52,39,28,33,40,30,31,50,47,29,48,49,32,65,196,194,195,66 %N A123494 Signature permutation of a Catalan automorphism: row 79361 of table A122202. %C A123494 This is the signature-permutation of Catalan automorphism which is derived from the automorphism *A123492 with the recursion schema KROF (defined in A122202). Like automorphisms *A057163 and *A069767/*A069768 these automorphisms are closed with respect to the subset of "zigzagging" binary trees (i.e., those binary trees where there are no nodes with two nonempty branches, or equivalently, those ones for which Stanley's interpretation (c) forms a non-branching line) and thus induce a permutation of binary strings. That is, starting from the root of such a binary tree, the turns taken by nonempty branches are interpreted as binary digits 0 or 1, depending on whether the tree grows to the left or right. In this manner, the Catalan automorphisms *A123494 and *A123493 induce the Binary Reflected Gray Code (see A003188 and A006068). %H A123494 <a href="/index/Per#IntegerPermutationCatAuto">Index entries for signature-permutations of Catalan automorphisms</a> %o A123494 (Scheme function, destructive implementation of this automorphism acting on S-expressions:) (define *A123494! (!KROF *A123492!)) %Y A123494 Inverse: A123493. Row 79361 of A122202. See also A123715 and A123716. %K A123494 nonn %O A123494 0,3 %A A123494 _Antti Karttunen_, Oct 11 2006