The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109995 Number of unlabeled ordered minimal T_0-covers of an n-set, cf. A094545. 1
 1, 1, 1, 2, 5, 18, 86, 549, 4647, 52060, 772976, 15240116, 400345371, 14063594530, 663256392496, 42161077371566, 3625838175218123, 423372648479289300, 67333725775723184308, 14628921614102655999804, 4352732830667872529962044 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS G. C. Greubel, Table of n, a(n) for n = 0..119 FORMULA a(n) = Sum_{m=0..n} binomial(2^m-m-1, n-m). MATHEMATICA Table[Sum[Binomial[2^m-m-1, n-m], {m, 0, n}], {n, 0, 50}] (* _G. C. Greubel_, Oct 08 2017 *) PROG (PARI) for(n=0, 50, print1(sum(m=0, n, binomial(2^m -m -1, n-m)), ", ")) \\ _G. C. Greubel_, Oct 08 2017 *) CROSSREFS Sequence in context: A371800 A020029 A020119 * A142153 A287227 A094294 Adjacent sequences: A109992 A109993 A109994 * A109996 A109997 A109998 KEYWORD easy,nonn AUTHOR Goran Kilibarda, _Vladeta Jovovic_, Sep 01 2005 STATUS approved

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

Last modified May 23 15:34 EDT 2024. Contains 372763 sequences. (Running on oeis4.)