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!)
A082144 A subdiagonal of number array A082137. 5
1, 4, 30, 224, 1680, 12672, 96096, 732160, 5601024, 42997760, 331082752, 2556051456, 19778969600, 153363087360, 1191302553600, 9268801044480, 72219408138240, 563445537177600, 4401135695953920, 34414895667609600 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

a(n) = (2^(n-1) + 0^n/2)*C(2*n+2, n).

(n+2)*a(n) +12*(-n-1)*a(n-1) +16*(2*n-1)*a(n-2)=0. - R. J. Mathar, Oct 29 2014

EXAMPLE

a(0)=(2^(-1)+(0^0)/2)C(2,0)=2*(1/2)=1 (use 0^0=1).

MATHEMATICA

Join[{1}, Table[2^(n-1)*Binomial[2*n+2, n], {n, 1, 50}]] (* G. C. Greubel, Feb 05 2018 *)

PROG

(PARI) for(n=0, 30, print1((2^(n-1) + 0^n/2)*Binomial(2*n+2, n), ", ")) \\ G. C. Greubel, Feb 05 2018

(MAGMA) [(2^(n-1) + 0^n/2)*Binomial(2*n+2, n): n in [0..30]]; // G. C. Greubel, Feb 05 2018

CROSSREFS

Cf. A069723, A082143, A082145.

Sequence in context: A007905 A084976 A000313 * A220727 A137971 A300159

Adjacent sequences:  A082141 A082142 A082143 * A082145 A082146 A082147

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Apr 06 2003

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 August 3 20:08 EDT 2020. Contains 336201 sequences. (Running on oeis4.)