[go: up one dir, main page]

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!)
Search: a091149 -id:a091149
Displaying 1-2 of 2 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A217275 Expansion of 2/(1-x+sqrt(1-2*x-27*x^2)). +10
8
1, 1, 8, 22, 141, 561, 3291, 15583, 88691, 459187, 2599570, 14136200, 80391235, 450046143, 2579291352, 14710321998, 85002979083, 491050703739, 2859262171872, 16674374605722, 97747766045679, 574231140306699, 3385974360904227, 20009363692187115, 118582649963026677 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
Generally for G.f. = 2/(1-x+sqrt(1-2x-(4*z-1)*x^2)) is asymptotic
a(n) ~ (1+2*sqrt(z))^(n+3/2)/(2*sqrt(Pi)*z^(3/4)*n^(3/2)); here we have the case z=7.
D-finite with recurrence: (n+2)*a(n)=(2*n+1)*a(n-1)+(4*z-1)*(n-1)*a(n-2);; here with z=7.
G.f.: 1/(1 - x - 7*x^2/(1 - x - 7*x^2/(1 - x - 7*x^2/(1 - x - 7*x^2/(1 - ....))))), a continued fraction. - Ilya Gutkovskiy, May 26 2017
MATHEMATICA
Table[SeriesCoefficient[2/(1-x+Sqrt[1-2*x-27*x^2]), {x, 0, n}], {n, 0, 25}]
Table[Sum[Binomial[n, 2k]*Binomial[2k, k]*7^k/(k+1), {k, 0, n}], {n, 0, 25}]
CROSSREFS
Cf. A001006 (z=1), A025235 (z=2), A025237 (z=3), A091147 (z=4), A091148 (z=5), A091149 (z=6).
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Sep 29 2012
STATUS
approved
A306684 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 2/(1 - x + sqrt(1 - 2*x + (1-4*k)*x^2)). +10
4
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 4, 1, 1, 1, 4, 7, 9, 1, 1, 1, 5, 10, 21, 21, 1, 1, 1, 6, 13, 37, 61, 51, 1, 1, 1, 7, 16, 57, 121, 191, 127, 1, 1, 1, 8, 19, 81, 201, 451, 603, 323, 1, 1, 1, 9, 22, 109, 301, 861, 1639, 1961, 835, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,9
LINKS
FORMULA
A(n,k) is the coefficient of x^n in the expansion of 1/(n+1) * (1 + x + k*x^2)^(n+1).
A(n,k) = Sum_{j=0..floor(n/2)} k^j * binomial(n,j) * binomial(n-j,j)/(j+1) = Sum_{j=0..floor(n/2)} k^j * binomial(n,2*j) * A000108(j).
(n+2) * A(n,k) = (2*n+1) * A(n-1,k) - (1-4*k) * (n-1) * A(n-2,k).
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, 1, 1, 1, ...
1, 1, 1, 1, 1, 1, 1, 1, ...
1, 2, 3, 4, 5, 6, 7, 8, ...
1, 4, 7, 10, 13, 16, 19, 22, ...
1, 9, 21, 37, 57, 81, 109, 141, ...
1, 21, 61, 121, 201, 301, 421, 561, ...
1, 51, 191, 451, 861, 1451, 2251, 3291, ...
1, 127, 603, 1639, 3445, 6231, 10207, 15583, ...
MATHEMATICA
T[n_, k_] := Sum[If[k == j == 0, 1, k^j] * Binomial[n, 2*j] * CatalanNumber[j], {j, 0, Floor[n/2]}]; Table[T[k, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, May 12 2021 *)
CROSSREFS
Main diagonal gives A307906.
KEYWORD
nonn,tabl
AUTHOR
Seiichi Manyama, May 06 2019
STATUS
approved
page 1

Search completed in 0.007 seconds

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 August 29 06:09 EDT 2024. Contains 375510 sequences. (Running on oeis4.)