login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A305693 a(n) = binomial(4*n, 2*n) - 4*n*binomial(2*n-2, n-1). 2
1, 2, 54, 852, 12550, 183356, 2698108, 40090728, 600970566, 9074671980, 137844584020, 2104090834456, 32247569822364, 495918392331992, 7648690018326840, 118264579157865424, 1832624131015069254, 28453041434367110220, 442512540108817131364 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..500

J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389 (pdf).

FORMULA

a(n) = A000984(2*n) - 4*n*A000984(n-1) for n > 0.

G.f.: sqrt(1 + sqrt(1 - 16*x))/sqrt(2*(1 - 16*x)) - 4*x*(1 - 2*x)/(1 - 4*x)^(3/2). - Ilya Gutkovskiy, Jun 08 2018

PROG

(PARI) {a(n) = binomial(4*n, 2*n)-4*n*binomial(2*n-2, n-1)}

CROSSREFS

Cf. A000984, A108558.

Sequence in context: A055024 A057411 A157058 * A071798 A123686 A122418

Adjacent sequences:  A305690 A305691 A305692 * A305694 A305695 A305696

KEYWORD

nonn

AUTHOR

Seiichi Manyama, Jun 08 2018

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 September 19 12:57 EDT 2019. Contains 327198 sequences. (Running on oeis4.)