[go: up one dir, main page]

login
Revision History for A032066 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from the same node are different.
(history; published version)
#10 by Alois P. Heinz at Thu Sep 20 16:30:06 EDT 2018
STATUS

proposed

approved

#9 by Andrew Howroyd at Thu Sep 20 15:31:10 EDT 2018
STATUS

editing

proposed

#8 by Andrew Howroyd at Thu Sep 20 15:01:00 EDT 2018
LINKS

Andrew Howroyd, <a href="/A032066/b032066.txt">Table of n, a(n) for n = 1..200</a>

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))}

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

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

STATUS

approved

editing

#7 by Russ Cox at Fri Mar 30 17:37:01 EDT 2012
AUTHOR

_Christian G. Bower (bowerc(AT)usa.net)_

Discussion
Fri Mar 30
17:37
OEIS Server: https://oeis.org/edit/global/178
#6 by Russ Cox at Sun Jul 10 18:22:33 EDT 2011
LINKS

<a href="/Sindx_index/Ro.html#rooted">Index entries for sequences related to rooted trees</a>

Discussion
Sun Jul 10
18:22
OEIS Server: https://oeis.org/edit/global/79
#5 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>

<a href="/Sindx_Ro.html#rooted">Index entries for sequences related to rooted trees</a>

KEYWORD

nonn,new

nonn

#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
LINKS

C. G. Bower, <a href="http://www.research.att.com/~njas/sequences/transforms2.html">Transforms (2)</a>

<a href="http://www.research.att.com/~njas/sequences/Sindx_Ro.html#rooted">Index entries for sequences related to rooted trees</a>

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004
NAME

Dyslexic Number of dyslexic rooted planar trees of with n nodes where any 2 subtrees extending from the same node are different.

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
LINKS

C. G. Bower, <a href="http://www.research.att.com/~njas/sequences/Sindx_Rtransforms2.html#rooted">Index entries for sequences related to rooted treesTransforms (2)</a>

<a href="http://www.research.att.com/~njas/sequences/transforms2Sindx_Ro.html#rooted">Transforms (2)Index entries for sequences related to rooted trees</a>

KEYWORD

nonn,new

nonn

AUTHOR

Christian G. Bower (bowerc@(AT)usa.net)

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999
NAME

Dyslexic rooted planar trees of n nodes where any 2 subtrees extending from the same node are different.

DATA

1, 1, 1, 2, 3, 6, 13, 29, 65, 151, 365, 887, 2185, 5426, 13636, 34529, 88017, 225621, 581461, 1505490, 3913987, 10214576, 26748565, 70263410, 185089117, 488842459, 1294194744, 3433966729, 9130325683, 24322504467

OFFSET

1,4

LINKS

<a href="http://www.research.att.com/~njas/sequences/Sindx_R.html#rooted">Index entries for sequences related to rooted trees</a>

<a href="http://www.research.att.com/~njas/sequences/transforms2.html">Transforms (2)</a>

FORMULA

"CGK" (necklace, elements, unlabeled) transform of A032065 (shifted right one place).

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc@usa.net)

STATUS

approved