A100192 -id:A100192 - cp's OEIS frontend

A088138 Generalized Gaussian Fibonacci integers.

0, 1, 2, 0, -8, -16, 0, 64, 128, 0, -512, -1024, 0, 4096, 8192, 0, -32768, -65536, 0, 262144, 524288, 0, -2097152, -4194304, 0, 16777216, 33554432, 0, -134217728, -268435456, 0, 1073741824, 2147483648, 0, -8589934592, -17179869184, 0, 68719476736, 137438953472

Offset: 0

Paul Barry, Sep 20 2003

The sequence 0,1,-2,0,8,-16,... has g.f. x/(1+2*x-4*x^2), a(n) = 2^n*sin(2n*Pi/3)/sqrt(3) and is the inverse binomial transform of sin(sqrt(3)*x)/sqrt(3): 0,1,-3,0,9,...
a(n+1) is the Hankel transform of A100192. - Paul Barry, Jan 11 2007
a(n+1) is the trinomial transform of A010892: a(n+1) = Sum_{k=0..2n} trinomial(n,k)*A010892(k+1) where trinomial(n, k) = trinomial coefficients (A027907). - Paul Barry, Sep 10 2007
a(n+1) is the Hankel transform of A100067. - Paul Barry, Jun 16 2009
From Paul Curtz, Oct 04 2009: (Start)
1) a(n) = A131577(n)*A128834(n).
2) Binomial transform of 0,1,0,-3,0,9,0,-27, see A000244.
3) Sequence is identical to every 2n-th difference divided by (-3)^n.
4) a(3n) + a(3n+1) + a(3n+2) = (-1)^n*3*A001018(n) for n >= 1.
5) For missing terms in a(n) see A013731 = 4*A001018. (End)
The coefficient of i of Q^n, where Q is the quaternion 1+i+j+k. Due to symmetry, also the coefficients of j and of k. - Stanislav Sykora, Jun 11 2012 [The coefficients of 1 are in A138230. - Wolfdieter Lang, Jan 28 2016]
With different signs, 0, 1, -2, 0, 8, -16, 0, 64, -128, 0, 512, -1024, ... is the Lucas U(-2,4) sequence. - R. J. Mathar, Jan 08 2013

Robert Israel, Table of n, a(n) for n = 0..3300
Beata Bajorska-Harapińska, Barbara Smoleń, and Roman Wituła, On Quaternion Equivalents for Quasi-Fibonacci Numbers, Shortly Quaternaccis, Advances in Applied Clifford Algebras (2019) Vol. 29, 54.
Wikipedia, Lucas sequence
Index entries for linear recurrences with constant coefficients, signature (2,-4).
Index entries for Lucas sequences

Cf. A084102, A088137, A045873, A088139, A138230.

a:=[0,1];; for n in [3..40] do a[n]:=2*a[n-1]-4*a[n-2]; od; a; # Muniru A Asiru, Oct 23 2018

I:=[0,1]; [n le 2 select I[n] else 2*Self(n-1) - 4*Self(n-2): n in [1..30]]; // G. C. Greubel, Jan 15 2018

M:= <<1+I,1+I>|>:
T:= <<-I/2,0>|<0,I/2>>:
seq(LinearAlgebra:-Trace(T.M^n),n=0..100); # Robert Israel, Jan 28 2016

Join[{a=0,b=1},Table[c=2*b-4*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 17 2011 *)
LinearRecurrence[{2, -4}, {0, 1}, 40] (* Vincenzo Librandi, Jan 29 2016 *)
Table[2^(n-2)*((-1)^Quotient[n-1,3]+(-1)^Quotient[n,3]), {n,0,40}] (*Federico Provvedi,Apr 24 2022*)

/* lists powers of any quaternion */
QuaternionToN(a,b,c,d,nmax) = {local (C);C = matrix(nmax+1,4);C[1,1]=1;for(n=2,nmax+1,C[n,1]=a*C[n-1,1]-b*C[n-1,2]-c*C[n-1,3]-d*C[n-1,4];C[n,2]=b*C[n-1,1]+a*C[n-1,2]+d*C[n-1,3]-c*C[n-1,4];C[n,3]=c*C[n-1,1]-d*C[n-1,2]+a*C[n-1,3]+b*C[n-1,4];C[n,4]=d*C[n-1,1]+c*C[n-1,2]-b*C[n-1,3]+a*C[n-1,4];);return (C);} /* Stanislav Sykora, Jun 11 2012 */

my(x='x+O('x^30)); concat([0], Vec(x/(1-2*x+4*x^2))) \\ G. C. Greubel, Oct 22 2018

a(n) = 2^(n-1)*polchebyshev(n-1, 2, 1/2); \\ Michel Marcus, May 02 2022

[lucas_number1(n,2,4) for n in range(0, 39)] # Zerinvary Lajos, Apr 23 2009

G.f.: x/(1-2*x+4*x^2).
E.g.f.: exp(x)*sin(sqrt(3)*x)/sqrt(3).
a(n) = 2*a(n-1) - 4*a(n-2), a(0)=0, a(1)=1.
a(n) = ((1+i*sqrt(3))^n - (1-i*sqrt(3))^n)/(2*i*sqrt(3)).
a(n) = Im( (1+i*sqrt(3))^n/sqrt(3) ).
a(n) = Sum_{k=0..floor(n/2)} C(n, 2*k+1)*(-3)^k.
From Paul Curtz, Oct 04 2009: (Start)
a(n) = a(n-1) + a(n-2) + 2*a(n-3).
a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3).
a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4). (End)
E.g.f.: exp(x)*sin(sqrt(3)*x)/sqrt(3) = G(0)*x^2 where G(k)= 1 + (3*k+2)/(2*x - 32*x^5/(16*x^4 - 3*(k+1)*(3*k+2)*(3*k+4)*(3*k+5)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jul 26 2012
G.f.: x/(1-2*x+4*x^2) = 2*x^2*G(0) where G(k)= 1 + 1/(2*x - 32*x^5/(16*x^4 - 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jul 27 2012
a(n) = -2^(n-1)*Product_{k=1..n}(1 + 2*cos(k*Pi/n)) for n >= 1. - Peter Luschny, Nov 28 2019
a(n) = 2^(n-1) * U(n-1, 1/2), where U(n, x) is the Chebyshev polynomial of the second kind. - Federico Provvedi, Apr 24 2022

A100193 a(n) = Sum_{k=0..n} binomial(2n,n+k)3^k.

Original entry on oeis.org

1, 5, 27, 146, 787, 4230, 22686, 121476, 649731, 3472382, 18546922, 99023292, 528535726, 2820451964, 15048601308, 80283276936, 428271193827, 2284478396334, 12185310873138, 64993897108236, 346655914156602, 1848916875734004, 9861224376230628, 52594507923308856

Offset: 0

Paul Barry, Nov 08 2004

A transform of 3^n under the mapping g(x)->(1/sqrt(1-4*x))*g(x*c(x)^2), where c(x) is the g.f. of the Catalan numbers A000108. A transform of 4^n under the mapping g(x)->(1/(c(x)*sqrt(1-4*x)))*g(x*c(x)).

Hankel transform is A127357. In general, the Hankel transform of Sum_{k=0..n} C(2n,k)*r^(n-k) is the sequence with g.f. 1/(1-2x+r^2*x^2). - Paul Barry, Jan 11 2007

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

Cf. A032443, A100192, A000108, A127357.

Table[Binomial[2*n,n]*Hypergeometric2F1[1,-n,1+n,-3],{n,0,20}] (* Vaclav Kotesovec, Feb 03 2014 *)

G.f.: (sqrt(1-4x)+1)/(sqrt(1-4x)*(4*sqrt(1-4x)-2)).
G.f.: sqrt(1-4x)*(3*sqrt(1-4x)-8x+3)/((1-4x)(6-32x)).
a(n) = Sum_{k=0..n} binomial(2n, n-k)*3^k.
a(n) = (Sum_{k=0..n} binomial(2n, n-k))*(Sum_{j=0..n} binomial(n, j)*(-1)^(n-j)*4^j).
a(n) = Sum_{k=0..n} C(n+k-1,k)*4^(n-k). - Paul Barry, Sep 28 2007
Conjecture: 9*n*a(n) + 6*(11-18*n)*a(n-1) + 16*(26*n-37)*a(n-2) + 256*(5-2*n)*a(n-3) = 0. - R. J. Mathar, Nov 09 2012
a(n) ~ (16/3)^n. - Vaclav Kotesovec, Feb 03 2014
a(n) = [x^n] 1/((1 - x)^n*(1 - 4*x)). - Ilya Gutkovskiy, Oct 12 2017

A293574 a(n) = Sum_{k=0..n} n^(n-k)*binomial(n+k-1,k).

Original entry on oeis.org

1, 2, 11, 82, 787, 9476, 139134, 2422218, 48824675, 1118286172, 28679699578, 814027423892, 25330145185646, 857375286365768, 31360145331198428, 1232586016712594010, 51805909208539809315, 2318588202311267591852, 110085368092924083334626, 5526615354023679440754396, 292501304641192746350100410

Offset: 0

Ilya Gutkovskiy, Oct 12 2017

nonn

a(n) is the n-th term of the main diagonal of iterated partial sums array of powers of n (see example).

			For n = 2 we have:
----------------------------
0   1   [2]   3    4     5
----------------------------
1,  2,   4,   8,  16,   32, ... A000079 (powers of 2)
1,  3,   7,  15,  31,   63, ... A126646 (partial sums of A000079)
1,  4, [11], 26,  57,  120, ... A000295 (partial sums of A126646)
----------------------------
therefore a(2) = 11.

Cf. A000312, A001700, A031973, A032443, A100192, A100193.

Join[{1}, Table[Sum[n^(n - k) Binomial[n + k - 1, k], {k, 0, n}], {n, 1, 20}]]
Table[SeriesCoefficient[1/((1 - x)^n (1 - n x)), {x, 0, n}], {n, 0, 20}]
Join[{1, 2}, Table[n^(2 n)/(n - 1)^n - Binomial[2 n, n + 1] Hypergeometric2F1[1, 2 n + 1, n + 2, 1/n]/n, {n, 2, 20}]]

a(n) = sum(k=0, n, n^(n-k)*binomial(n+k-1,k)); \\ Michel Marcus, Oct 12 2017

a(n) = [x^n] 1/((1 - x)^n*(1 - n*x)).

a(n) ~ exp(1) * n^n. - Vaclav Kotesovec, Oct 16 2017

A385498 a(n) = Sum_{k=0..n} 2^(n-k) * binomial(4*n,k).

Original entry on oeis.org

1, 6, 48, 408, 3564, 31626, 283548, 2560872, 23255964, 212101176, 1941110628, 17815257048, 163896843300, 1510891524252, 13952756564424, 129048895061208, 1195191116753436, 11082661017288264, 102877353868090080, 955912961224763232, 8889969049985302464

Offset: 0

Seiichi Manyama, Jul 30 2025

Cf. A100192, A385004, A386699.

Cf. A005810, A066381, A371814, A386701.

Table[(81/8)^n - Binomial[4*n, n]*(-1 + Hypergeometric2F1[1, -3*n, 1 + n, -1/2]), {n,0,25}] (* Vaclav Kotesovec, Jul 30 2025 *)

a(n) = sum(k=0, n, 2^(n-k)*binomial(4*n, k));

a(n) = [x^n] 1/((1-3*x) * (1-x)^(3*n)).
a(n) = Sum_{k=0..n} 3^(n-k) * binomial(3*n+k-1,k).
From Vaclav Kotesovec, Jul 30 2025: (Start)
Recurrence: 24*n*(3*n - 2)*(3*n - 1)*(139*n^3 - 366*n^2 + 143*n + 132)*a(n) = (588665*n^6 - 2281011*n^5 + 2262209*n^4 + 1245939*n^3 - 3359986*n^2 + 1877400*n - 322560)*a(n-1) - 648*(2*n - 3)*(4*n - 7)*(4*n - 5)*(139*n^3 + 51*n^2 - 172*n + 48)*a(n-2).
a(n) ~ 2^(8*n + 1/2) / (sqrt(Pi*n) * 3^(3*n - 1/2)). (End)
G.f.: g/((3-2*g) * (4-3*g)) where g = 1+x*g^4 is the g.f. of A002293. - Seiichi Manyama, Aug 13 2025
a(n) = Sum_{k=0..n} 3^k * (-2)^(n-k) * binomial(4*n,k) * binomial(4*n-k-1,n-k). - Seiichi Manyama, Aug 15 2025
G.f.: 1/(1 - x*g^3*(12-6*g)) where g = 1+x*g^4 is the g.f. of A002293. - Seiichi Manyama, Aug 17 2025

A386699 a(n) = Sum_{k=0..n} 2^(n-k) * binomial(5*n,k).

Original entry on oeis.org

1, 7, 69, 733, 8061, 90462, 1028871, 11814376, 136643085, 1589311381, 18569375114, 217773347502, 2561944357311, 30219704365104, 357278540928168, 4232449819704768, 50227362114232109, 596988743410929087, 7105534815529752831, 84678089652554263155, 1010268312800732117946

Offset: 0

Seiichi Manyama, Jul 30 2025

Cf. A000244, A100192, A385004, A385498.
Cf. A163455, A371739, A386702.
Cf. A002294.

Table[(243/16)^n - Binomial[5*n, n]*(-1 + Hypergeometric2F1[1, -4*n, 1 + n, -1/2]), {n,0,25}] (* Vaclav Kotesovec, Jul 30 2025 *)

a(n) = sum(k=0, n, 2^(n-k)*binomial(5*n, k));

a(n) = [x^n] 1/((1-3*x) * (1-x)^(4*n)).
a(n) = Sum_{k=0..n} 3^(n-k) * binomial(4*n+k-1,k).
From Vaclav Kotesovec, Jul 30 2025: (Start)
Recurrence: 128*n*(2*n - 1)*(4*n - 3)*(4*n - 1)*(3052*n^4 - 15114*n^3 + 26432*n^2 - 18693*n + 4131)*a(n) = 8*(42807352*n^8 - 285737492*n^7 + 758983420*n^6 - 1002945218*n^5 + 644348866*n^4 - 111879380*n^3 - 84004497*n^2 + 44187381*n - 5806080)*a(n-1) - 1215*(5*n - 9)*(5*n - 8)*(5*n - 7)*(5*n - 6)*(3052*n^4 - 2906*n^3 - 598*n^2 + 1037*n - 192)*a(n-2).
a(n) ~ 5^(5*n + 1/2) / (sqrt(Pi*n) * 2^(8*n + 1/2)). (End)
G.f.: g/((3-2*g) * (5-4*g)) where g = 1+x*g^5 is the g.f. of A002294. - Seiichi Manyama, Aug 13 2025
a(n) = Sum_{k=0..n} 3^k * (-2)^(n-k) * binomial(5*n,k) * binomial(5*n-k-1,n-k). - Seiichi Manyama, Aug 15 2025
G.f.: 1/(1 - x*g^4*(15-8*g)) where g = 1+x*g^5 is the g.f. of A002294. - Seiichi Manyama, Aug 17 2025

A385004 a(n) = Sum_{k=0..n} 2^(n-k) * binomial(3*n,k).

Original entry on oeis.org

1, 5, 31, 200, 1311, 8665, 57556, 383556, 2561871, 17140007, 114819351, 769925568, 5166845124, 34696155564, 233113911208, 1566926561740, 10536427052463, 70872688450083, 476854924775869, 3209222876463192, 21602639249766951, 145444151677134153, 979397744169608784

Offset: 0

Seiichi Manyama, Jul 30 2025

Cf. A000244, A100192, A385498, A386699.
Cf. A005809, A066380, A165817, A371813, A386700.
Cf. A001764, A386617.

Table[(27/4)^n - Binomial[3*n, n] * (-1 + Hypergeometric2F1[1, -2*n, 1 + n, -1/2]), {n, 0, 25}] (* Vaclav Kotesovec, Jul 30 2025 *)

a(n) = sum(k=0, n, 2^(n-k)*binomial(3*n, k));

a(n) = [x^n] 1/((1-3*x) * (1-x)^(2*n)).
a(n) = Sum_{k=0..n} 3^(n-k) * binomial(2*n+k-1,k).
From Vaclav Kotesovec, Jul 30 2025: (Start)
Recurrence: 8*n*(2*n - 1)*(15*n - 23)*a(n) = 6*(540*n^3 - 1503*n^2 + 1239*n - 320)*a(n-1) - 81*(3*n - 5)*(3*n - 4)*(15*n - 8)*a(n-2).
a(n) ~ 3^(3*n) / 2^(2*n+1) * (1 + 5/(3*sqrt(3*Pi*n))). (End)
G.f.: g/(3-2*g)^2 where g = 1+x*g^3 is the g.f. of A001764. - Seiichi Manyama, Aug 13 2025
a(n) = Sum_{k=0..n} 3^k * (-2)^(n-k) * binomial(3*n,k) * binomial(3*n-k-1,n-k). - Seiichi Manyama, Aug 15 2025
G.f.: 1/(1 - x*g^2*(9-4*g)) where g = 1+x*g^3 is the g.f. of A001764. - Seiichi Manyama, Aug 17 2025

A386960 a(n) = Sum_{k=0..n} 8^k * binomial(2*n,n-k).

Original entry on oeis.org

1, 10, 102, 1036, 10502, 106380, 1077276, 10908096, 110447046, 1118286172, 11322685172, 114642332232, 1160754172316, 11752638152824, 118995469654968, 1204829162684136, 12198895398209862, 123513816397462524, 1250577392936568708, 12662096110945862856, 128203723152486704052

Offset: 0

Seiichi Manyama, Aug 11 2025

nonn

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

Cf. A032443, A072547, A088218, A100192, A100193.

[&+[8^k * Binomial(2*n, n-k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Aug 13 2025

Table[Sum[8^k*Binomial[2*n,n-k],{k,0,n}],{n,0,25}] (* Vincenzo Librandi, Aug 13 2025 *)

a(n) = sum(k=0, n, 8^k*binomial(2*n, n-k));

a(n) = [x^n] 1/((1-9*x) * (1-x)^n).
a(n) = Sum_{k=0..n} 9^k * (-8)^(n-k) * binomial(2*n,k) * binomial(2*n-k-1,n-k).
a(n) = Sum_{k=0..n} 9^k * binomial(2*n-k-1,n-k).
G.f.: (1+sqrt(1-4*x))/( sqrt(1-4*x) * (9*sqrt(1-4*x)-7) ).

A113955 Riordan array (1/((1-4x)c(x)),xc(x)/sqrt(1-4x)), c(x) the g.f. of A000108.

Original entry on oeis.org

1, 3, 1, 11, 6, 1, 42, 30, 9, 1, 163, 140, 58, 12, 1, 638, 630, 325, 95, 15, 1, 2510, 2772, 1686, 624, 141, 18, 1, 9908, 12012, 8330, 3682, 1064, 196, 21, 1, 39203, 51480, 39796, 20264, 7050, 1672, 260, 24, 1, 155382, 218790, 185517, 106203, 42849, 12303, 2475

Offset: 0

Paul Barry, Nov 09 2005

Columns include A032443,A002457,A018218,A038836. Row sums are A100192. Diagonal sums are A113956.

			Triangle begins
1;
3, 1;
11, 6, 1;
42, 30, 9, 1;
163, 140, 58, 12, 1;
638, 630, 325, 95, 15, 1;

Riordan array ((1/(1-4x)+1/sqrt(1-4x))/2, (2x/((1-4x)+sqrt(1-4x)))); Number triangle T(n, k)=sum{j=0..n, C(j, j-k)C(2n, n-j)}.

T(n,k)=sum{j=0..n, C(2n,j)C(n-j,k)}; - Paul Barry, Apr 03 2006

cp's OEIS Frontend

A088138 Generalized Gaussian Fibonacci integers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

PARI

Sage

Formula

A100193 a(n) = Sum_{k=0..n} binomial(2*n,n+k)*3^k.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A293574 a(n) = Sum_{k=0..n} n^(n-k)*binomial(n+k-1,k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A385498 a(n) = Sum_{k=0..n} 2^(n-k) * binomial(4*n,k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Formula

A386699 a(n) = Sum_{k=0..n} 2^(n-k) * binomial(5*n,k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Formula

A385004 a(n) = Sum_{k=0..n} 2^(n-k) * binomial(3*n,k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Formula

A386960 a(n) = Sum_{k=0..n} 8^k * binomial(2*n,n-k).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A113955 Riordan array (1/((1-4x)c(x)),xc(x)/sqrt(1-4x)), c(x) the g.f. of A000108.

Views

Author

A100193 a(n) = Sum_{k=0..n} binomial(2n,n+k)3^k.