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.

A032133 Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors.

This page as a plain text file.
%I A032133 #11 Aug 30 2018 15:50:14
%S A032133 2,3,12,61,340,2070,13178,87115,590720,4089214,28766442,205072330,
%T A032133 1478149486,10754615963,78878136418,582563752101,4328922702536,
%U A032133 32341244773080,242781826475456,1830377795460438
%N A032133 Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors.
%H A032133 Andrew Howroyd, <a href="/A032133/b032133.txt">Table of n, a(n) for n = 1..200</a>
%H A032133 C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H A032133 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A032133 Doubles (index 2+) under "BIK" (reversible, indistinct, unlabeled) transform.
%o A032133 (PARI)
%o A032133 BIK(p)={(1/(1-p) + (1+p)/subst(1-p, x, x^2))/2}
%o A032133 seq(n)={my(p=2*x); for(i=2, n, p+=x^i*polcoeff(BIK(p) + O(x*x^i), i)); Vecrev(p/x)} \\ _Andrew Howroyd_, Aug 30 2018
%Y A032133 Cf. A032132.
%K A032133 nonn
%O A032133 1,1
%A A032133 _Christian G. Bower_