Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084876
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084876 Number of (k,m,n)-antichains of multisets with k=3 and m=4. +0
1
0, 0, 0, 310, 159300, 32389900, 4469327850, 503689260970, 50466655894200, 4701945998612200, 418104908350395750, 36055756736065208230, 3046399249526576159700, 253883533322134812268900 (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/4!*(81^n - 12*54^n + 24*42^n + 4*36^n - 24*31^n + 6*27^n + 6*26^n - 36*18^n + 36*14^n + 11*9^n - 22*6^n + 6*3^n).

CROSSREFS

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

Sequence in context: A114484 A051981 A134549 this_sequence A060339 A046016 A142005

Adjacent sequences: A084873 A084874 A084875 this_sequence A084877 A084878 A084879

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 December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research