login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007010 Number of 4-voter voting schemes with n linearly ranked choices.
(Formerly M4851)
0
1, 12, 81, 372, 1332, 3984, 10420, 24540, 53145, 107436, 205065, 372792, 649936, 1092672, 1779408, 2817288, 4350105, 6567660, 9716905, 14114892, 20163924 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

D. E. Loeb (daniel.loeb(AT)verizon.net), On Games, Voting Schemes and Distributive Lattices. LaBRI Report 625-93, University of Bordeaux I, 1993.

FORMULA

G.f.: [1+6x+21x^2+28x^3+21x^4+6x^5+x^6]/[(1+x)^3(1-x)^9]. - Ralf Stephan, Apr 23 2004

CROSSREFS

Sequence in context: A009500 A012195 A147650 * A069996 A183504 A194493

Adjacent sequences:  A007007 A007008 A007009 * A007011 A007012 A007013

KEYWORD

nonn

AUTHOR

Daniel LOEB, daniel.loeb(AT)verizon.net

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:02 EST 2012. Contains 205852 sequences.