cp's OEIS Frontend

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it descends along the 111... ray, starting swapping already at the root. Specifically, *A154452 = psi(A154442), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it returns back toward the root, after descending down to the leftmost tip of the tree along the 000... ray, so that the last vertex whose descendants are swapped, is the left-hand side child of the root and the root itself is fixed. Specifically, *A154453 = psi(A154443), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it descends along the 000... ray, but not starting swapping until at the left-hand side child of the root, leaving the root itself fixed. Specifically, *A154454 = psi(A154444), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it returns back toward the root, after descending down to the leftmost tip of the tree along the 000... ray, so that the last vertex whose descendants are swapped is the root node of the tree. Specifically, *A154455 = psi(A154445), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it descends along the 000... ray, starting swapping already at the root. Specifically, *A154456 = psi(A154446), where the isomorphism psi is given in A153141 (see further comments there).

A002487(n)/A002487(n+1), n > 0, runs through all the reduced nonnegative rationals exactly once. A002487 is the Stern's sequence. A002487(a(n)) = A002487(n+1) n>0 . - Yosu Yurramendi, Jul 07 2016

A "fleeing tree" sequence computed for Catalan bijection CatBij gives for each binary tree A014486(n) the number of cases where, when a new V-node (a bud) is inserted into one of the A072643(n)+1 possible leaves of that tree, it follows that (CatBij tree) is not a subtree of (CatBij tree-with-bud-inserted). I.e., for each tree A014486(n), we compute Sum_{i=0}^A072643(n) (1 if catbij(n) is a subtree of catbij(A153250bi(n,i)), 0 otherwise). Here A153250 gives the bud-inserting operation. Note that for any Catalan Bijection, which is an image of "psi" isomorphism (see A153141) from the Automorphism Group of infinite binary trees, the result will be A000004, the zero-sequence. To satisfy that condition, CatBij should at least satisfy A127302(CatBij(n)) = A127302(n) for all n (clearly A057164 does not satisfy that, so we got nonzero terms here). However, that is just a necessary but not a sufficient condition. For example, A123493 & A123494 satisfy it, but they still produce nonzero sequences: A153247, A153248.

The Hadamard (Hadamard-Walsh) matrix is widely used in telecommunications and signal analysis. It has 3 well-known forms which vary according to the sequency ordering of its rows: "natural" ordering, "dyadic" or Payley ordering, and sequency ordering. In a mathematical context the sequency is the number of zero crossings or transitions in a matrix row (although in a physical signal context, it is half the number of zero crossings per time period). The matrix row sequencies are a permutation of the set [0,1,2,...n-1], where n is the order of the matrix. For spectral analysis of signals the sequency-ordered form is needed. Unlike the dyadic ordering (given by A153141), the natural ordering requires a separate list for each matrix order. This sequence is the natural sequency ordering for an order 8 matrix.

See A240908 for context. This sequence is the natural sequency ordering for an order 32 matrix.