Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084879
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084879 Number of (k,m,n)-multiantichains of multisets with k=3 and m=2. +0
1
1, 3, 18, 189, 2106, 22113, 220158, 2114829, 19853586, 183662073, 1683014598, 15327998469, 139038783066, 1257874611633, 11360039237838, 102475402586109, 923689049088546, 8321664384098793, 74945758272961878, 674816500839877749 (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/2!*(9^n - 2*6^n+3*3^n).

CROSSREFS

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

Sequence in context: A108994 A006472 A132853 this_sequence A141118 A033030 A002824

Adjacent sequences: A084876 A084877 A084878 this_sequence A084880 A084881 A084882

KEYWORD

nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research