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.
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!)
A087729 Let X be the poset of finite subsets of the positive integers. The sequence is the number of downsets in X of cardinality n modulo equivalence by permutations of the positive integers. 0
1, 1, 1, 2, 2, 3, 5, 8, 11, 18, 29, 49, 83, 148, 267, 507, 977, 1958, 4041, 8626, 18942 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
a(21) took about 78 hours to compute on a fast DEC alpha (using Magma).
LINKS
EXAMPLE
a(5) = 2 because the only example up to permutation are {{},{1},{2},{1,2},{3}} {{},{1},{2},{3},{4}}.
CROSSREFS
Sequence in context: A111123 A261091 A179523 * A039890 A347546 A152948
KEYWORD
hard,more,nonn,nice
AUTHOR
Victor S. Miller, Sep 30 2003
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 05:47 EDT 2024. Contains 373432 sequences. (Running on oeis4.)