Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079267
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079267 d(n,s) = number of perfect matchings on {1, 2, ..., n} with k short pairs. +0
3
1, 0, 1, 1, 1, 1, 5, 6, 3, 1, 36, 41, 21, 6, 1, 329, 365, 185, 55, 10, 1, 3655, 3984, 2010, 610, 120, 15, 1, 47844, 51499, 25914, 7980, 1645, 231, 21, 1, 721315, 769159, 386407, 120274, 25585, 3850, 406, 28, 1, 12310199, 13031514, 6539679, 2052309, 446544 (list; table; graph; listen)
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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research