The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A000526

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
newer changes | Showing entries 11-20 | older changes

A000526

Number of partially labeled trees with n nodes (5 of which are labeled).
(history; published version)

#31 by Robert A. Russell at Thu Mar 23 16:49:02 EDT 2023

CROSSREFS

Cf. A000055, A000107, A000243, A000269, A000444, A000485, A000524, A000525, A034799(n,5).

STATUS

approved

editing

#30 by Alois P. Heinz at Sat Dec 30 14:09:55 EST 2017

STATUS

proposed

approved

#29 by Andrew Howroyd at Sat Dec 30 13:32:37 EST 2017

STATUS

editing

proposed

#28 by Andrew Howroyd at Sat Dec 30 12:37:21 EST 2017

LINKS

Vincenzo Librandi, <a href="/A000526/b000526.txt">Table of n, a(n) for n = 05..200</a>

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

Discussion

Sat Dec 30

13:32

Andrew Howroyd: Bfile link text has different range to actual bfile contents, (actual bfile offset confirmed consistent with data).

#27 by Alois P. Heinz at Mon Dec 29 17:46:13 EST 2014

STATUS

editing

approved

#26 by Alois P. Heinz at Mon Dec 29 17:46:10 EST 2014

MAPLE

b:= proc(n) option remember; if n<=1 then n else add(k*b(k)* s(n-1, k), k=1..n-1)/(n-1) fi end: s:= proc(n, k) option remember; add(b(n+1-j*k), j=1..iquo(n, k)) end: B:= proc(n) option remember; add (b(k)*x^k, k=1..n) end: a:= n-> coeff (series (B(n-4)^5* (125-204*B(n-4) +118*B(n-4)^2 -24*B(n-4)^3)/ (1-B(n-4))^7, x=0, n+1), x, n): seq (a(n), n=5..23); # Alois P. Heinz, Aug 21 2008

STATUS

approved

editing

#25 by Joerg Arndt at Fri Mar 21 13:06:44 EDT 2014

STATUS

reviewed

approved

#24 by Bruno Berselli at Fri Mar 21 09:29:31 EDT 2014

STATUS

proposed

reviewed

#23 by Vincenzo Librandi at Fri Mar 21 09:22:26 EDT 2014

STATUS

editing

proposed

#22 by Vincenzo Librandi at Fri Mar 21 09:22:17 EDT 2014

LINKS

<a href="/index/Tra#trees">Index entries for sequences related to trees</a>