Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060639 Number of pairs of partitions of [n] whose join is the partition {{1,2,...,n}}. +0
2
1, 1, 3, 15, 119, 1343, 19905, 369113, 8285261, 219627683, 6746244739, 236561380795, 9356173080985, 413251604702069, 20215438754502217, 1087524296159855603, 63950948621703499839, 4089003767746536828183 (list; graph; listen)
OFFSET

0,3

LINKS

E. R. Canfield, Meet and join in the partition lattice, Electronic Journal of Combinatorics, 8 (2001) R15.

B. Pittel, Where the typical set partitions meet and join, Electronic Journal of Combinatorics, 7 (2000) R5.

FORMULA

The e.g.f. J(x) satisfies the equation Sum_{n=0}^{\infty} (B_n)^2 x^n/n! = exp(J(x)-1), where B_n is the n-th Bell number.

EXAMPLE

J(2) = 3 because there are two partitions of {1,2}, and of the four pairs of partitions, only the pair ( {{1},{2}}, {{1},{2}} ) fails to have join {{1,2}}.

CROSSREFS

Bell numbers: A000110, Stirling numbers of the second kind: A000225, number of pairs whose meet equals {{1}, {2}, ..., {n}}: A059849.

Cf. A001188.

Sequence in context: A136654 A121422 A136739 this_sequence A068052 A068859 A006454

Adjacent sequences: A060636 A060637 A060638 this_sequence A060640 A060641 A060642

KEYWORD

nonn

AUTHOR

E. R. Canfield (erc(AT)cs.uga.edu), Apr 16 2001

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 18 2001

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research