A166965 -id:A166965 - cp's OEIS frontend

A166914 a(n) = 20a(n-1) - 64a(n-2) for n > 1; a(0) = 21, a(1) = 340.

21, 340, 5456, 87360, 1398016, 22369280, 357912576, 5726617600, 91625947136, 1466015416320, 23456247709696, 375299967549440, 6004799497568256, 96076792028200960, 1537228672719650816, 24595658764588154880

Offset: 0

Klaus Brockhaus, Oct 27 2009

nonn

Related to Reverse and Add trajectory of 318 in base 4: A075153(6*n+2) = 240*a(n).

G. C. Greubel, Table of n, a(n) for n = 0..500
Index entries for linear recurrences with constant coefficients, signature (20,-64).

Cf. A075153, A166912, A166913, A166915, A166916, A166917, A166927, A166965, A166984.

[Binomial(4^(n+3), 2)/96: n in [0..30]]; // G. C. Greubel, Oct 02 2024

CoefficientList[Series[(21-80x)/((1-4x)(1-16x)),{x,0,20}],x]  (* or *) LinearRecurrence[{20,-64},{21,340},20] (* Harvey P. Dale, Feb 23 2011 & Mar 30 2012 *)

{m=15; v=concat([21, 340], vector(m-2)); for(n=3, m, v[n]=20*v[n-1]-64*v[n-2]); v}

A166914=BinaryRecurrenceSequence(20,-64,21,340)
[A166914(n) for n in range(31)] # G. C. Greubel, Oct 02 2024

a(n) = (64*16^n - 4^n)/3.
G.f.: (21 - 80*x)/((1-4*x)*(1-16*x)).
Limit_{n -> infinity} a(n)/a(n-1) = 16.
From G. C. Greubel, May 28 2016: (Start)
a(n) = 20*a(n-1) - 64*a(n-2).
E.g.f.: (1/3)*(-exp(4*x) + 64*exp(16*x)). (End)

A166917 a(n) = 20a(n-1) - 64a(n-2) for n > 1; a(0) = 85, a(1) = 1364.

Original entry on oeis.org

85, 1364, 21840, 349504, 5592320, 89478144, 1431654400, 22906486784, 366503854080, 5864061927424, 93824991887360, 1501199874392064, 24019198007050240, 384307168179912704, 6148914691147038720, 98382635059426361344, 1574122160955116748800, 25185954575299047849984

Offset: 0

Klaus Brockhaus, Oct 27 2009

Related to Reverse and Add trajectory of 318 in base 4: A075153(6*n+5) = 240*a(n).

G. C. Greubel, Table of n, a(n) for n = 0..500
Index entries for linear recurrences with constant coefficients, signature (20, -64).

Cf. A075153, A166912, A166913, A166914, A166915, A166916, A166927, A166965, A166984.

[Binomial(4^(n+4), 2)/384: n in [0..30]]; // G. C. Greubel, Oct 02 2024

LinearRecurrence[{20,-64}, {85, 1364}, 50] (* G. C. Greubel, May 28 2016 *)

{m=15; v=concat([85, 1364], vector(m-2)); for(n=3, m, v[n]=20*v[n-1]-64*v[n-2]); v}

A166917=BinaryRecurrenceSequence(20,-64,85,1364)
[A166917(n) for n in range(31)] # G. C. Greubel, Oct 02 2024

a(n) = (256*16^n - 4^n)/3.
G.f.: (85 - 336*x)/((1-4*x)*(1-16*x)).
Limit_{n -> infinity} a(n)/a(n-1) = 16.
E.g.f.: (1/3)*(256*exp(16*x) - exp(4*x)). - G. C. Greubel, May 28 2016

A166984 a(n) = 20a(n-1) - 64a(n-2) for n > 1; a(0) = 1, a(1) = 20.

Original entry on oeis.org

1, 20, 336, 5440, 87296, 1397760, 22368256, 357908480, 5726601216, 91625881600, 1466015154176, 23456246661120, 375299963355136, 6004799480791040, 96076791961092096, 1537228672451215360, 24595658763514413056, 393530540233410478080, 6296488643803287126016

Offset: 0

Klaus Brockhaus, Oct 26 2009

Partial sums of A166965.

First differences of A006105. - Klaus Purath, Oct 15 2020

Seiichi Manyama, Table of n, a(n) for n = 0..830 (terms 0..200 from Vincenzo Librandi)
E. Saltürk and I. Siap, Generalized Gaussian Numbers Related to Linear Codes over Galois Rings, European Journal of Pure and Applied Mathematics, Vol. 5, No. 2, 2012, 250-259; ISSN 1307-5543. - From _N. J. A. Sloane_, Oct 23 2012
Index entries for linear recurrences with constant coefficients, signature (20,-64).

Cf. A000302, A002450, A002452, A002453, A006105, A079598, A083584.

Cf. A115490, A166914, A166917, A166927, A166965, A307695.

[n le 2 select 19*n-18 else 20*Self(n-1)-64*Self(n-2): n in [1..17] ];

LinearRecurrence[{20,-64},{1,20},30] (* Harvey P. Dale, Jul 04 2012 *)

a(n) = (4*16^n - 4^n)/3 \\ Charles R Greathouse IV, Jun 21 2022

A166984=BinaryRecurrenceSequence(20,-64,1,20)
[A166984(n) for n in range(31)] # G. C. Greubel, Oct 02 2024

a(n) = (4*16^n - 4^n)/3.
G.f.: 1/((1-4*x)*(1-16*x)).
Limit_{n -> oo} a(n)/a(n-1) = 16.
a(n) = A115490(n+1)/3.
Sum_{n>=0} a(n) x^(2*n+4)/(2*n+4)! = ( sinh(x) )^4/4!. - Robert A. Russell, Apr 03 2013
From Klaus Purath, Oct 15 2020: (Start)
a(n) = A002450(n+1)*(A002450(n+2) - A002450(n))/5.
a(n) = (A083584(n+1)^2 - A083584(n)^2)/80. (End)
a(n) = (A079598(n) - A000302(n))/24. - César Aguilera, Jun 21 2022
a(n) = 16*a(n-1) + 4^n with a(0) = 1. - Nadia Lafreniere, Aug 08 2022
E.g.f.: (4/3)*exp(10*x)*sinh(6*x + log(2)). - G. C. Greubel, Oct 02 2024

A232535 Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2n,2k) + binomial(2n+1,2k))/2.

Original entry on oeis.org

1, 1, 2, 1, 8, 3, 1, 18, 25, 4, 1, 32, 98, 56, 5, 1, 50, 270, 336, 105, 6, 1, 72, 605, 1320, 891, 176, 7, 1, 98, 1183, 4004, 4719, 2002, 273, 8, 1, 128, 2100, 10192, 18590, 13728, 4004, 400, 9, 1, 162, 3468, 22848, 59670, 68068, 34476, 7344, 561, 10, 1, 200, 5415

Offset: 0

Philippe Deléham, Nov 25 2013

Sum_{k=0..n}T(n,k)*x^k = A164111(n), A000012(n), A002001(n), A001653(n+1), A001019(n), A166965(n) for x =-1, 0, 1, 2, 4, 9 respectively.

			Triangle begins:
1
1, 2
1, 8, 3
1, 18, 25, 4
1, 32, 98, 56, 5
1, 50, 270, 336, 105, 6
1, 72, 605, 1320, 891, 176, 7
1, 98, 1183, 4004, 4719, 2002, 273, 8
1, 128, 2100, 10192, 18590, 13728, 4004, 400, 9

Cf. A086645, A091042
Cf. Columns : A000012, A001105, A180324 ; Diagonals: A000027, A131423
Cf. T(2*n,n): A228329, Row sums : A002001

T := (n,k) -> binomial(2*n, 2*k)*(2*n+1-k)/(2*n+1-2*k);
seq(seq(T(n,k), k=0..n), n=0..9); # Peter Luschny, Nov 26 2013

Flatten[Table[(Binomial[2n,2k]+Binomial[2n+1,2k])/2,{n,0,10},{k,0,n}]] (* Harvey P. Dale, Jul 05 2015 *)

G.f.: (1-x)/(1-2*x*(1+y)+x^2*(1-y)^2).
T(n,k) = 2*T(n-1,k)+2*T(n-1,k-1)+2*T(n-2,k-1)-T(n-2,k)-T(n-2,k-2), T(0,0)=T(1,0)=1, T(1,1)=2, T(n,k)=0 if k<0 or if k>n.
T(n,k) = (A086645(n,k) + A091042(n,k))/2.
T(n,k) = binomial(2*n,2*k)*(2*n+1-k)/(2*n+1-2*k). - Peter Luschny, Nov 26 2013

cp's OEIS Frontend

A166914 a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 21, a(1) = 340.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A166917 a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 85, a(1) = 1364.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A166984 a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 1, a(1) = 20.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A232535 Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A166914 a(n) = 20a(n-1) - 64a(n-2) for n > 1; a(0) = 21, a(1) = 340.

A166917 a(n) = 20a(n-1) - 64a(n-2) for n > 1; a(0) = 85, a(1) = 1364.

A166984 a(n) = 20a(n-1) - 64a(n-2) for n > 1; a(0) = 1, a(1) = 20.

A232535 Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2n,2k) + binomial(2n+1,2k))/2.