login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015034 q-Catalan numbers (binomial version) for q=4. 1
1, 1, 17, 4433, 18245201, 1197172898385, 1255709588423576145, 21068918017101222558779985, 5655752483351603939678821837720145, 24291387778773301588924456932322615789898321 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..41

FORMULA

a(n) = binomial(2*n, n, q)/(n+1)_q, where binomial(n,m,q) is the q-binomial coefficient, with q=4.

a(n) = ((1-q)/(1-q^(n+1)))*Product_{k=0..(n-1)} (1-q^(2*n-k))/(1-q^(k+1)), with q=4. - G. C. Greubel, Nov 11 2018

MATHEMATICA

Table[3*QBinomial[2 n, n, 4]/(4^(n + 1) - 1), {n, 0, 20}] (* G. C. Greubel, Nov 11 2018 *)

PROG

(PARI) q=4; for(n=0, 20, print1(((1-q)/(1-q^(n+1)))*prod(k=0, n-1, (1-q^(2*n-k))/(1-q^(k+1))), ", ")) \\ G. C. Greubel, Nov 11 2018

(MAGMA) q:=4; [1] cat [((1-q)/(1-q^(n+1)))*(&*[(1-q^(2*n-k))/(1-q^(k+1)): k in [0..n-1]]): n in [1..20]]; // G. C. Greubel, Nov 11 2018

CROSSREFS

Cf. A015030 (q=2).

Sequence in context: A329168 A194015 A015058 * A161583 A013722 A238610

Adjacent sequences:  A015031 A015032 A015033 * A015035 A015036 A015037

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 28 00:32 EST 2020. Contains 331313 sequences. (Running on oeis4.)