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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A162533 a(n) = Sum_{k=0..n} binomial(n,2k)*A002426(k). 1
1, 1, 2, 4, 10, 26, 68, 176, 454, 1174, 3052, 7976, 20932, 55108, 145448, 384704, 1019462, 2706214, 7194956, 19155896, 51065260, 136284236, 364097912, 973654240, 2605983772, 6980545276, 18712478072, 50196568144, 134739960904, 361892443592, 972537193168 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Hankel transform is (-1)^binomial(n,2)*(-2)^A128054(n) (see A128055).
LINKS
FORMULA
G.f.: (1-x)/((1-x)^2-x^2-2x^4/((1-x)^2-x^2-x^4/((1-x)^2-x^2-x^4/(1-... (continued fraction).
G.f.: (1-x)/sqrt(1-4*x+4*x^2-4*x^4) = (1-x)/sqrt((1-2*x)^2-4*x^4) = (1-x)/sqrt((1-x-2*x^2)*(1-x+2*x^2)). - Paul Barry, Oct 13 2009
Conjecture: n*a(n) + (4-5*n)*a(n-1) + 2*(4*n-7)*a(n-2) + 4*(3-n)*a(n-3) + 4*(2-n)*a(n-4) + 4*(n-4)*a(n-5) = 0. - R. J. Mathar, Nov 16 2011
a(n) ~ 3^(1/4) * (1 + sqrt(3))^(n + 1/2) / (2^(3/2) * sqrt(Pi*n)). - Vaclav Kotesovec, Jun 08 2019
MATHEMATICA
b[n_] := If[n < 0, 0, 3^n Hypergeometric2F1[1/2, -n, 1, 4/3]]; Table[Sum[Binomial[n, 2*k]*b[k], {k, 0, n}], {n, 0, 50}] (* or *) CoefficientList[Series[(1-x)/sqrt(1-4*x+4*x^2-4*x^4), {x, 0, 50}], x] (* G. C. Greubel, Feb 27 2017 *)
PROG
(PARI) x='x+O('x^50); Vec((1-x)/sqrt(1-4*x+4*x^2-4*x^4)) \\ G. C. Greubel, Feb 27 2017
CROSSREFS
Cf. A027826.
Sequence in context: A307756 A149810 A095337 * A055819 A052995 A113337
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Jul 05 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)