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.

A080299 A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).

This page as a plain text file.
%I A080299 #13 Jul 29 2017 12:21:15
%S A080299 2,50,818,914,13106,13202,14642,14738,15506,209714,209810,211250,
%T A080299 211346,212114,234290,234386,235826,235922,236690,248114,248210,
%U A080299 248978,255122,3355442,3355538,3356978,3357074,3357842,3380018,3380114,3381554
%N A080299 A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).
%C A080299 These trees are obtained by replacing each non-root terminal node (a leaf) of the binary tree with a branch of two leaves, i.e., "." -> "\/".
%H A080299 A. Karttunen, <a href="/A014486/a014486.ps.gz">Nine initial trees can be found here</a> (The trees with the ordinal numbers 1., 6., 39., 53., 345., 359., 477., 491. and 567.)
%H A080299 R. P. Stanley, <a href="http://www-math.mit.edu/~rstan/ec/catalan.pdf">Exercises on Catalan and Related Numbers</a>
%F A080299 a(n) = A080310(A014486(n)).
%Y A080299 a(n) = A014486(A080298(n)). Breadth-first-wise encoding: A080313.
%K A080299 nonn
%O A080299 0,1
%A A080299 _Antti Karttunen_, Mar 02 2003