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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013776 a(n) = 2^(4n+1). 6
2, 32, 512, 8192, 131072, 2097152, 33554432, 536870912, 8589934592, 137438953472, 2199023255552, 35184372088832, 562949953421312, 9007199254740992, 144115188075855872, 2305843009213693952 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

a(n) ~ -Pi*E(2*n)/B(2*n), E(n) Euler number, B(n) Bernoulli number. - Peter Luschny, Oct 28 2012

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Tanya Khovanova, Recursive Sequences

Index to divisibility sequences

Index entries for linear recurrences with constant coefficients, signature (16).

FORMULA

a(n) = 16*a(n-1), n > 0; a(0) = 2. G.f.: 2/(1 - 16*x). - Philippe Deléham, Nov 23 2008

a(n) = Sum_{k = 0..n} binomial(2*k,k)*binomial(4*n + 2 - 2*k, 2*n + 1 - k). Bisection of A264960. - Peter Bala, Nov 29 2015

a(n) = A000079(A016813(n)). - Michel Marcus, Nov 30 2015

a(n) = Sum_{k = 0..2*n} binomial(4*n + 2, 2*k + 1) = A004171(2*n). - Peter Bala, Nov 25 2016

EXAMPLE

G.f. = 2 + 32*x + 512*x^2 + 8192*x^3 + 131072*x^4 + 2097152*x^5 + ...

PROG

(MAGMA) [2^(4*n+1): n in [0..20]]; // Vincenzo Librandi, Jun 27 2011

(PARI) a(n)=2<<(4*n) \\ Charles R Greathouse IV, Apr 07 2012

CROSSREFS

Cf. A000079, A016813, A264960, A004171.

Sequence in context: A163952 A246213 A022028 * A174491 A022019 A010045

Adjacent sequences:  A013773 A013774 A013775 * A013777 A013778 A013779

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 23 08:43 EDT 2017. Contains 286909 sequences.