This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A005254 M2779 M2780 #49 Jul 02 2025 16:01:54
%S A005254 1,3,9,21,51,117,271,607,1363,3013,6643,14491,31495,67965,146115,
%T A005254 312483,666015,1413915,2992815,6315135,13292007,27906585,58464339,
%U A005254 122229123,255072423,531369483,1105217223,2295383319,4760727375
%N A005254 Number of weighted voting procedures.
%D A005254 M. Klamkin, ed., Problems in Applied Mathematics: Selections from SIAM Review, SIAM, 1990; see pp. 122-123.
%D A005254 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.
%D A005254 T. V. Narayana, Lattice Path Combinatorics with Statistical Applications. Univ. Toronto Press, 1979, pp. 100-101.
%D A005254 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D A005254 Solution to Board of Directors Problem, J. Rec. Math., 9 (No. 3, 1977), 240.
%H A005254 Reinhard Zumkeller, <a href="/A005254/b005254.txt">Table of n, a(n) for n = 1..1000</a>
%H A005254 G. Kreweras, <a href="http://www.numdam.org/item?id=MSH_1983__84__45_0">Sur quelques problèmes relatifs au vote pondéré</a>, [Some problems of weighted voting], Math. Sci. Humaines No. 84 (1983), 45-63.
%H A005254 B. E. Wynne & N. J. A. Sloane, <a href="/A002083/a002083_1.pdf">Correspondence, 1976-84</a>
%H A005254 B. E. Wynne & T. V. Narayana, <a href="/A002083/a002083_2.pdf">Tournament configuration, weighted voting, and partitioned catalans</a>, Preprint.
%H A005254 Bayard Edmund Wynne, and T. V. Narayana, <a href="http://www.numdam.org/item?id=BURO_1981__36__75_0">Tournament configuration and weighted voting</a>, Cahiers du bureau universitaire de recherche opérationnelle, 36 (1981): 75-78.
%H A005254 <a href="/A005254/a005254.pdf">Solution to Board of Directors Problem</a>, J. Rec. Math., 9 (No. 3, 1977), 240. (Annotated scanned copy)
%t A005254 a[1, 1] = 1; a[n_, 1] := a[n, 1] = a[n - 1, Floor[(n + 1)/2]]; a[n_, k_ /; k > 1] := a[n, k] = a[n, 1] + a[n - 1, k - 1]; A005254 = Table[ Sum[ a[n, k], {k, 1, n}], {n, 1, 29}] (* _Jean-François Alcover_, Apr 03 2012, after recurrence of A037254 *)
%o A005254 (Haskell)
%o A005254 a005254 = sum . a037254_row -- _Reinhard Zumkeller_, Nov 18 2012
%Y A005254 Row sums of A037254.
%K A005254 nonn,nice,easy
%O A005254 1,2
%A A005254 _N. J. A. Sloane_
%E A005254 More terms from _James Sellers_, Feb 04 2000