The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A051643 Central elements in Parker's partition triangle. 5
 1, 3, 20, 169, 1667, 18084, 208960, 2527074, 31630390, 406680465, 5342750699, 71442850111, 969548468960, 13323571588607, 185072895183632, 2594890728951909, 36681505784903758, 522291180086851188, 7484621370716999785, 107876522368295972285, 1562916545414144667559 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..90 R. K. Guy, Parker's permutation problem involves the Catalan numbers, Amer. Math. Monthly 100 (1993), 287-289. FORMULA a(n) = coefficient of q^((m^2-1)/2) = q(2*n*(n+1)) in the q-binomial coefficient [2*m, m] = [2*(2*n+1), 2*n+1], where m = 2*n+1. [Corrected by Petros Hadjicostas, May 30 2020] a(n) is the number of partitions of 2*n*(n+1) into at most 2*n+1 parts each no bigger than 2*n+1. - Petros Hadjicostas, May 30 2020 MAPLE b:= proc(n, i, t) option remember; `if`(n=0, 1, `if`(t*i b(2*n*(n+1), 2*n+1\$2): seq(a(n), n=0..20); # Alois P. Heinz, May 30 2020 MATHEMATICA a[n_] := SeriesCoefficient[QBinomial[2(2n+1), 2n+1, q], {q, 0, 2n(n+1)}]; Table[a[n], {n, 0, 17}] (* Jean-François Alcover, Aug 19 2019 *) CROSSREFS Cf. A007042, A047812, A136621. Sequence in context: A341963 A276315 A145329 * A213377 A357094 A216583 Adjacent sequences: A051640 A051641 A051642 * A051644 A051645 A051646 KEYWORD easy,nonn,nice AUTHOR James A. Sellers EXTENSIONS a(18)-a(20) from Alois P. Heinz, May 30 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 19 09:52 EDT 2024. Contains 376008 sequences. (Running on oeis4.)