Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084881
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084881 Number of (k,m,n)-multiantichains of multisets with k=3 and m=4. +0
1
1, 3, 39, 1873, 237531, 35640463, 4584906969, 507411694933, 50579357233311, 4705226804488123, 418198020376490949, 36058355701780773793, 3046470997266047282091, 253885499519508283406983 (list; graph; listen)
OFFSET

0,2

COMMENT

By a (k,m,n)-multiantichain of multisets we mean an m-multiantichain of k-bounded multisets on an n-set. The elements of a multiantichain could have the multiplicities greater than 1. A multiset is called k-bounded if every its element has the multiplicity not greater than k-1.

LINKS

Goran Kilibarda and Vladeta Jovovic, Antichains of Multisets, J. Integer Seqs., Vol. 7, 2004.

FORMULA

1/4!*(81^n - 12*54^n+24*42^n+4*36^n - 24*31^n+18*27^n+6*26^n - 108*18^n+108*14^n+83*9^n - 166*6^n+90*3^n).

CROSSREFS

Cf. A016269, A047707, A051112-A051118, A084869-A084883.

Adjacent sequences: A084878 A084879 A084880 this_sequence A084882 A084883 A084884

Sequence in context: A064732 A092610 A082159 this_sequence A015017 A076628 A097421

KEYWORD

nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 10 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research