login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032065 Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different. 2
1, 1, 1, 2, 3, 6, 14, 31, 70, 163, 407, 984, 2445, 6089, 15412, 39189, 100217, 257720, 666068, 1729169, 4505362, 11784473, 30917383, 81358804, 214658044, 567792612, 1505281859, 3999183421, 10645793860 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..200

C. G. Bower, Transforms (2)

Index entries for sequences related to rooted trees

FORMULA

Shifts left under "BGK" (reversible, element, unlabeled) transform.

PROG

(PARI)

BGK(v)={apply(p->subst(serlaplace(y^0*p + polcoeff(p, 1)), y, 1)/2, Vec(prod(k=1, #v, (1 + x^k*y + O(x*x^#v))^v[k])-1, -#v))}

seq(n)={my(v=[1]); for(i=2, n, v=concat([1], BGK(v))); v} \\ Andrew Howroyd, Sep 20 2018

CROSSREFS

Sequence in context: A264078 A006444 A032047 * A099968 A291401 A010357

Adjacent sequences:  A032062 A032063 A032064 * A032066 A032067 A032068

KEYWORD

nonn

AUTHOR

Christian G. Bower

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 22:48 EDT 2018. Contains 316297 sequences. (Running on oeis4.)