The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A305004 Number of labeled hypertrees (connected acyclic antichains) spanning some subset of {1,...,n} without singleton edges. 2
 1, 1, 2, 8, 52, 507, 6844, 118582, 2504856, 62370530, 1788082154, 57997339633, 2099638691440, 83922479506504, 3670657248913386, 174387350448735878, 8942472292255441104, 492294103555090048459, 28958704109012732921524 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Andrew Howroyd, Table of n, a(n) for n = 0..200 FORMULA a(n > 0) = A304939(n) + 1. Binomial transform of A030019 if we assume A030019(1) = 0. EXAMPLE The a(3) = 8 hypertrees: {} {{1,2}} {{1,3}} {{2,3}} {{1,2,3}} {{1,2},{1,3}} {{1,2},{2,3}} {{1,3},{2,3}} PROG (PARI) \\ here b(n) is A030019 with b(1)=0. b(n)=if(n<2, n==0, sum(i=0, n, stirling(n-1, i, 2)*n^(i-1))); a(n)=sum(k=0, n, binomial(n, k)*b(k)); \\ Andrew Howroyd, Aug 27 2018 CROSSREFS Cf. A030019, A035053, A134958, A134959, A304386, A304939, A304968, A304970. Sequence in context: A209307 A323843 A132228 * A151879 A191552 A154828 Adjacent sequences:  A305001 A305002 A305003 * A305005 A305006 A305007 KEYWORD nonn AUTHOR Gus Wiseman, May 23 2018 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 13:25 EST 2022. Contains 350455 sequences. (Running on oeis4.)