Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084880
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084880 Number of (k,m,n)-multiantichains of multisets with k=3 and m=3. +0
1
1, 3, 28, 701, 28156, 1105553, 38746288, 1242925421, 37586964436, 1093785614153, 31039025026648, 866337233127941, 23916052195646716, 655400382364459553, 17872830907936220608, 485794685997062639261, 13175148372787020760996 (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/3!*(27^n - 6*18^n+6*14^n+9*9^n - 18*6^n+14*3^n).

CROSSREFS

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

Sequence in context: A062497 A056066 A092985 this_sequence A110259 A015474 A053601

Adjacent sequences: A084877 A084878 A084879 this_sequence A084881 A084882 A084883

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research