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

 

Logo
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

%I #7 Oct 08 2017 18:49:16

%S 1,1,1,2,5,18,86,549,4647,52060,772976,15240116,400345371,14063594530,

%T 663256392496,42161077371566,3625838175218123,423372648479289300,

%U 67333725775723184308,14628921614102655999804,4352732830667872529962044

%N Number of unlabeled ordered minimal T_0-covers of an n-set, cf. A094545.

%H G. C. Greubel, <a href="/A109995/b109995.txt">Table of n, a(n) for n = 0..119</a>

%F a(n) = Sum_{m=0..n} binomial(2^m-m-1, n-m).

%t Table[Sum[Binomial[2^m-m-1, n-m], {m,0,n}], {n, 0, 50}] (* _G. C. Greubel_, Oct 08 2017 *)

%o (PARI) for(n=0,50, print1(sum(m=0,n, binomial(2^m -m -1, n-m)), ", ")) \\ _G. C. Greubel_, Oct 08 2017 *)

%K easy,nonn

%O 0,4

%A Goran Kilibarda, _Vladeta Jovovic_, Sep 01 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 05:26 EDT 2024. Contains 373697 sequences. (Running on oeis4.)