Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112311 a(1)=1, a(2)=2, a(3)=9; a(n) = n*(n - 2)*a(n - 1)^2/(n - 1). +0
2
1, 2, 9, 216, 174960, 146932807680, 125937291507579224064000, 108755666689817047890109782510255885778944000000, 93143885917529328515023382841413836868525118214478405334515136630707122998865821\ 696000000000000 (list; graph; listen)
OFFSET

1,2

COMMENT

Lower bound to number of perfect Morse matchings of n-simplex.

REFERENCES

M. K. Chari and M. Joswig, Complexes of discrete Morse functions, Disc. Math. 302 (2005), 39-51.

CROSSREFS

Cf. A005271.

Sequence in context: A069649 A111832 A114563 this_sequence A067564 A165797 A011823

Adjacent sequences: A112308 A112309 A112310 this_sequence A112312 A112313 A112314

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 01 2005

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