OFFSET
1,1
COMMENTS
Appears to satisfy a(1)=2, a(2)=3, a(3)=5 and, for n>3, a(n)=3a(n-1)-2a(n-2) if n is even and a(n)=a(n-1)+2a(n-2)-a([(n-1)/2]-1) if n is odd. - John W. Layman, Jan 10 2000.
REFERENCES
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
G. Kreweras, Sur quelques problèmes relatifs au vote pondéré, [Some problems of weighted voting], Math. Sci. Humaines No. 84 (1983), 45-63.
B. E. Wynne & N. J. A. Sloane, Correspondence, 1976-84
B. E. Wynne & T. V. Narayana, Tournament configuration, weighted voting, and partitioned catalans, Preprint.
Bayard Edmund Wynne, and T. V. Narayana, Tournament configuration and weighted voting, Cahiers du bureau universitaire de recherche opérationnelle, 36 (1981): 75-78.
FORMULA
Empirical g.f.: x*(x^16 +2*x^14 -12*x^13 +8*x^12 -6*x^11 +5*x^10 -3*x^7 +x^6 +9*x^5 -6*x^4 +3*x^3 -2*x^2 -3*x +2) / ((x -1)*(2*x -1)*(x^2 +1)*(2*x^2 -1)*(x^4 +1)*(2*x^4 -1)). - Colin Barker, Mar 16 2015
MATHEMATICA
a={2, 3, 5}; For[i=4, i<35, i++, If[EvenQ[i], a=Append[a, 3 a[[i-1]]-2a[[i-2]]], a=Append[a, a[[i-1]]+2a[[i-2]]-a[[(i-1)/2-1]]]]]; a
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
EXTENSIONS
More terms from Vit Planocka (planocka(AT)mistral.cz), Sep 20 2002
STATUS
approved