|
Search: id:A005256
|
|
|
| A005256 |
|
Number of weighted voting procedures.
(Formerly M2556)
|
|
+0
1
|
|
| 1, 3, 6, 12, 23, 45, 87, 171, 336, 666, 1320, 2628, 5233, 10443, 20841, 41637, 83187, 166287, 332403, 664635, 1328934, 2657532, 5314398, 10628130, 21254940, 42508560, 85014492, 170026356, 340047479, 680089725, 1360169007, 2720327571
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
G. Kreweras, Sur quelques problemes relatifs au vote pondere, [ Some problems of weighted voting ] Math. Sci. Humaines No. 84 (1983), 45-63.
T. V. Narayana, Recent progress and unsolved problems in dominance theory, pp. 68-78 of Combinatorial mathematics (Canberra 1977), Lect. Notes Math. Vol. 686, 1978.
T. V. Narayana, Lattice Path Combinatorics with Statistical Applications. Univ. Toronto Press, 1979, pp. 100-101.
|
|
LINKS
|
Herman Jamke (hermanjamke(AT)fastmail.fm), Feb 23 2008, Table of n, a(n) for n = 1..60
Kreweras, G., Sur quelques problemes relatifs au vote pondere, Mathematiques et Sciences Humaines, 84 (1983), p. 45-63
|
|
FORMULA
|
a(n+1) = 2a(n)-a([(n-2)/2]) starting with a(1)=1 and a(2)=3 (a(n)=0 if n<1). Also a(n)=A062178(n+2)-2. - Herman Jamke (hermanjamke(AT)fastmail.fm), Feb 23 2008
|
|
PROGRAM
|
(PARI) a(n)=if(n<3, (n>0)+2*(n>1), 2*a(n-1)-a((n-3)\2)) - Herman Jamke (hermanjamke(AT)fastmail.fm), Feb 23 2008
|
|
CROSSREFS
|
Sequence in context: A079735 A050243 A024505 this_sequence A097979 A003204 A038620
Adjacent sequences: A005253 A005254 A005255 this_sequence A005257 A005258 A005259
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Feb 23 2008
|
|
|
Search completed in 0.005 seconds
|
