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
%I A112311
%S A112311 1,2,9,216,174960,146932807680,125937291507579224064000,108755666689817047890109782510255885778944000000,
%T A112311 93143885917529328515023382841413836868525118214478405334515136630707122998865821696000000000000
%N A112311 a(1)=1, a(2)=2, a(3)=9; a(n) = n*(n - 2)*a(n - 1)^2/(n - 1).
%C A112311 Lower bound to number of perfect Morse matchings of n-simplex.
%D A112311 M. K. Chari and M. Joswig, Complexes of discrete Morse functions, Disc. 
               Math. 302 (2005), 39-51.
%Y A112311 Cf. A005271.
%Y A112311 Sequence in context: A069649 A111832 A114563 this_sequence A067564 A165797 
               A011823
%Y A112311 Adjacent sequences: A112308 A112309 A112310 this_sequence A112312 A112313 
               A112314
%K A112311 nonn
%O A112311 1,2
%A A112311 N. J. A. Sloane (njas(AT)research.att.com), Dec 01 2005

    
page 1

Search completed in 0.001 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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research