Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084874 Number of (k,m,n)-antichains of multisets with k=3 and m=2. +0
1
0, 0, 9, 162, 2025, 21870, 219429, 2112642, 19847025, 183642390, 1682955549, 15327821322, 139038251625, 1257873017310, 11360034454869, 102475388237202, 923689006041825, 8321664254958630, 74945757885541389, 674816499677616282 (list; graph; listen)
OFFSET

0,3

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/2!*(9^n - 2*6^n+3^n).

CROSSREFS

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

Sequence in context: A023039 A159831 A133793 this_sequence A158749 A133681 A157553

Adjacent sequences: A084871 A084872 A084873 this_sequence A084875 A084876 A084877

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