Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084875
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084875 Number of (k,m,n)-antichains of multisets with k=3 and m=3. +0
1
0, 0, 1, 350, 24025, 1061570, 38306701, 1238697950, 37547263825, 1093418309690, 31035659056501, 866306577308150, 23915774118612025, 655397866616830610, 17872808187862527901, 485794481046271815950, 13175146525408965630625 (list; graph; listen)
OFFSET

0,4

COMMENT

By a (k,m,n)-antichain of multisets we mean an m-antichain of k-bounded multisets on an n-set. 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+3*9^n - 6*6^n+2*3^n).

CROSSREFS

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

Sequence in context: A109762 A074055 A108776 this_sequence A074203 A045126 A025385

Adjacent sequences: A084872 A084873 A084874 this_sequence A084876 A084877 A084878

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research