A152166 -id:A152166 - cp's OEIS frontend

A354785 Numbers of the form 32^k or 92^k.

3, 6, 9, 12, 18, 24, 36, 48, 72, 96, 144, 192, 288, 384, 576, 768, 1152, 1536, 2304, 3072, 4608, 6144, 9216, 12288, 18432, 24576, 36864, 49152, 73728, 98304, 147456, 196608, 294912, 393216, 589824, 786432, 1179648, 1572864, 2359296, 3145728, 4718592, 6291456, 9437184, 12582912, 18874368, 25165824, 37748736, 50331648

Offset: 1

N. J. A. Sloane, Jul 12 2022

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

The following sequences are all essentially the same, in the sense that they are simple transformations of each other, with A029744 = {s(n), n>=1}, the numbers 2^k and 3*2^k, as the parent: A029744 (s(n)); A052955 (s(n)-1), A027383 (s(n)-2), A354788 (s(n)-3), A347789 (s(n)-4), A209721 (s(n)+1), A209722 (s(n)+2), A343177 (s(n)+3), A209723 (s(n)+4); A060482, A136252 (minor differences from A354788 at the start); A354785 (3*s(n)), A354789 (3*s(n)-7). The first differences of A029744 are 1,1,1,2,2,4,4,8,8,... which essentially matches eight sequences: A016116, A060546, A117575, A131572, A152166, A158780, A163403, A320770. The bisections of A029744 are A000079 and A007283.

seq[max_] := Union[Table[3*2^n, {n, 0, Floor[Log2[max/3]]}], Table[9*2^n, {n, 0, Floor[Log2[max/9]]}]]; seq[10^8] (* Amiram Eldar, Jan 16 2024 *)

Sum_{n>=1} 1/a(n) = 8/9. - Amiram Eldar, Jan 16 2024

G.f.: (3*x^2+6*x+3)/(1-2*x^2). - Georg Fischer, Apr 10 2025

A062110 A(n,k) is the coefficient of x^k in (1-x)^n/(1-2*x)^n for n, k >= 0; Table A read by descending antidiagonals.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 4, 5, 3, 1, 0, 8, 12, 9, 4, 1, 0, 16, 28, 25, 14, 5, 1, 0, 32, 64, 66, 44, 20, 6, 1, 0, 64, 144, 168, 129, 70, 27, 7, 1, 0, 128, 320, 416, 360, 225, 104, 35, 8, 1, 0, 256, 704, 1008, 968, 681, 363, 147, 44, 9, 1, 0, 512, 1536, 2400, 2528, 1970

Offset: 0

Henry Bottomley, May 30 2001

The triangular version of this square array is defined by T(n,k) = A(k,n-k) for 0 <= k <= n. Conversely, A(n,k) = T(n+k,n) for n,k >= 0. We have [o.g.f of T](x,y) = [o.g.f. of A](x*y, x) and [o.g.f. of A](x,y) = [o.g.f. of T](y,x/y). - Petros Hadjicostas, Feb 11 2021
From Paul Barry, Nov 10 2008: (Start)
As number triangle, Riordan array (1, x(1-x)/(1-2x)). A062110*A007318 is A147703.
[0,1,1,0,0,0,....] DELTA [1,0,0,0,.....]. (Philippe Deléham's DELTA is defined in A084938.) (End)
Modulo 2, this triangle T becomes triangle A106344. - Philippe Deléham, Dec 18 2008

			Table A(n,k) (with rows n >= 0 and columns k >= 0) begins:
  1, 0,  0,   0,   0,    0,    0,     0,     0,     0, ...
  1, 1,  2,   4,   8,   16,   32,    64,   128,   256, ...
  1, 2,  5,  12,  28,   64,  144,   320,   704,  1536, ...
  1, 3,  9,  25,  66,  168,  416,  1008,  2400,  5632, ...
  1, 4, 14,  44, 129,  360,  968,  2528,  6448, 16128, ...
  1, 5, 20,  70, 225,  681, 1970,  5500, 14920, 39520, ...
  1, 6, 27, 104, 363, 1182, 3653, 10836, 31092, 86784, ...
  ... - _Petros Hadjicostas_, Feb 15 2021
Triangle T(n,k) (with rows n >= 0 and columns k = 0..n) begins:
  1;
  0,   1;
  0,   1,   1;
  0,   2,   2,   1;
  0,   4,   5,   3,   1;
  0,   8,  12,   9,   4,   1;
  0,  16,  28,  25,  14,   5,   1;
  0,  32,  64,  66,  44,  20,   6,   1;
  0,  64, 144, 168, 129,  70,  27,   7,   1;
  0, 128, 320, 416, 360, 225, 104,  35,   8,   1;
  ... - _Philippe Deléham_, Nov 30 2008

Michael De Vlieger, Table of n, a(n) for n = 0..11475 (rows 0 <= n <= 150, flattened.)
Eunice Y. S. Chan, Robert M. Corless, Laureano Gonzalez-Vega, J. Rafael Sendra, and Juana Sendra, Upper Hessenberg and Toeplitz Bohemians, arXiv:1907.10677 [cs.SC], 2019.
Milan Janjić, Words and Linear Recurrences, J. Int. Seq., 21 (2018), #18.1.4.

Rows of A include A000007, A011782, A045623, A058396, A062109, A169792, A169793, A169794, A169795, A169796, A169797.
Columns of A include A000012, A001477, A000096, A000297.
Main diagonal of A is A002002.
Table A(n, k) is a multiple of 2^(k-n); dividing by this gives a table similar to A050143 except at the edges.
Essentially the same array as A105306, A160232.

t[n_, n_] = 1; t[n_, k_] := 2^(n-2*k)*k*Hypergeometric2F1[1-k, n-k+1, 2, -1]; Table[t[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Oct 30 2013, after Philippe Deléham + symbolic sum *)

a(i,j)=if(i<0 || j<0,0,polcoeff(((1-x)/(1-2*x)+x*O(x^j))^i,j))

Formulas for the square array (A(n,k): n,k >= 0):
A(n, k) = A(n-1, k) + Sum_{0 <= j < k} A(n, j) for n >= 1 and k >= 0 with A(0, k) = 0^k for k >= 0.
G.f.: 1/(1-x*(1-y)/(1-2*y)) = Sum_{i, j >= 0} A(i, j) x^i*y^j.
From Petros Hadjicostas, Feb 15 2021: (Start)
A(n,k) = 2^(k-n)*n*hypergeom([1-n, k+1], [2], -1) for n >= 0 and k >= 1.
A(n,k) = 2*A(n,k-1) + A(n-1,k) - A(n-1,k-1) for n,k >= 1 with A(n,0) = 1 for n >= 0 and A(0,k) = 0 for k >= 1. (End)
Formulas for the triangle (T(n,k): 0 <= k <= n):
From Philippe Deléham, Aug 01 2006: (Start)
T(n,k) = A121462(n+1,k+1)*2^(n-2*k) for 0 <= k < n.
T(n,k) = 2^(n-2*k)*k*hypergeom([1-k, n-k+1], [2], -1) for 0 <= k < n. (End)
Sum_{k=0..n} T(n,k)*x^k = A152239(n), A152223(n), A152185(n), A152174(n), A152167(n), A152166(n), A152163(n), A000007(n), A001519(n), A006012(n), A081704(n), A082761(n), A147837(n), A147838(n), A147839(n), A147840(n), A147841(n), for x = -7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7,8,9 respectively. - Philippe Deléham, Dec 09 2008
T(n,k) = 2*T(n-1,k) + T(n-1,k-1) - T(n-2,k-1) for 1 <= k <= n-1 with T(0,0) = T(1,1) = T(2,1) = T(2,2) = 1, T(1,0) = T(2,0) = 0, and T(n,k) = 0 if k > n or if k < 0. - Philippe Deléham, Oct 30 2013
G.f.: Sum_{n.k>=0} T(n,k)*x^n*y^k = (1 - 2*x)/(x^2*y - x*y - 2*x + 1). - Petros Hadjicostas, Feb 15 2021

Various sections edited by Petros Hadjicostas, Feb 15 2021

A208343 Triangle of coefficients of polynomials v(n,x) jointly generated with A208342; see the Formula section.

Original entry on oeis.org

1, 0, 2, 0, 1, 3, 0, 1, 2, 5, 0, 1, 2, 5, 8, 0, 1, 2, 6, 10, 13, 0, 1, 2, 7, 13, 20, 21, 0, 1, 2, 8, 16, 29, 38, 34, 0, 1, 2, 9, 19, 39, 60, 71, 55, 0, 1, 2, 10, 22, 50, 86, 122, 130, 89, 0, 1, 2, 11, 25, 62, 116, 187, 241, 235, 144, 0, 1, 2, 12, 28, 75, 150, 267, 392, 468

Offset: 1

Clark Kimberling, Feb 25 2012

u(n,n) = A000045(n+1) (Fibonacci numbers).
n-th row sum:  2^(n-1)
As triangle T(n,k) with 0 <= k <= n, it is (0, 1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Feb 26 2012

			First five rows:
  1;
  0, 2;
  0, 1, 3;
  0, 1, 2, 5;
  0, 1, 2, 5, 8;
First five polynomials v(n,x):
  1
     2x
      x + 3x^2
      x + 2x^2 + 5x^3
      x + 2x^2 + 5x^3 + 8x^4.

Cf. A208343.

Cf. A084938, A000045, A000079.

u[1, x_] := 1; v[1, x_] := 1; z = 13;
u[n_, x_] := u[n - 1, x] + x*v[n - 1, x];
v[n_, x_] := x*u[n - 1, x] + x*v[n - 1, x];
Table[Expand[u[n, x]], {n, 1, z/2}]
Table[Expand[v[n, x]], {n, 1, z/2}]
cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];
TableForm[cu]
Flatten[%]  (* A208342 *)
Table[Expand[v[n, x]], {n, 1, z}]
cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
TableForm[cv]
Flatten[%]  (* A208343 *)

u(n,x) = u(n-1,x) + x*v(n-1,x),
v(n,x) = x*u(n-1,x) + x*v(n-1,x),
where u(1,x)=1, v(1,x)=1.
From Philippe Deléham, Feb 26 2012: (Start)
As triangle T(n,k) with 0 <= k <= n:
T(n,k) = T(n-1,k) + T(n-1,k-1) + T(n-2,k-2) - T(n-2,k-1), T(0,0) = 1, T(1,0) = 0, T(1,1) = 2, T(n,k) = 0 if k > n or if k < 0.
G.f.: (1-(1-y)*x)/(1-(1+y)*x+y*(1-y)*x^2).
Sum_{k=0..n} T(n,k)*x^k = (-1)*A091003(n+1), A152166(n), A000007(n), A000079(n), A055099(n), A152224(n) for x = -2, -1, 0, 1, 2, 3 respectively.
Sum_{k=0..n} T(n,k)*x^(n-k) = A087205(n), A140165(n+1), A016116(n+1), A000045(n+2), A000079(n), A122367(n), A006012(n), A052961(n), A154626(n) for x = -3, -2, -1, 0, 1, 2, 3, 4 respectively. (End)
T(n,k) = A208748(n,k)/2^k. - Philippe Deléham, Mar 05 2012

A152185 a(n) = -3a(n-1) + 5a(n-2), n > 1; a(0)=1, a(1)=-5.

Original entry on oeis.org

1, -5, 20, -85, 355, -1490, 6245, -26185, 109780, -460265, 1929695, -8090410, 33919705, -142211165, 596232020, -2499751885, 10480415755, -43940006690, 184222098845, -772366329985, 3238209484180, -13576460102465

Offset: 0

Philippe Deléham, Nov 28 2008

Paolo Xausa, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-3,5).

Cf. A152163, A152166, A152167, A152174.

LinearRecurrence[{-3, 5}, {1, -5}, 25] (* Paolo Xausa, Jan 19 2024 *)

Vec((1-2*x)/(1+3*x-5*x^2)+O(x^99)) \\ Charles R Greathouse IV, Jan 11 2012

G.f.: (1-2x)/(1+3x-5x^2).
a(n) = Sum_{k=0..n} A147703(n,k)*(-6)^k.
a(n) = (-1)^n*A152187(n). - Philippe Deléham, Nov 29 2008

cp's OEIS Frontend

A354785 Numbers of the form 3*2^k or 9*2^k.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A062110 A(n,k) is the coefficient of x^k in (1-x)^n/(1-2*x)^n for n, k >= 0; Table A read by descending antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A208343 Triangle of coefficients of polynomials v(n,x) jointly generated with A208342; see the Formula section.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A152185 a(n) = -3*a(n-1) + 5*a(n-2), n > 1; a(0)=1, a(1)=-5.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A354785 Numbers of the form 32^k or 92^k.

A152185 a(n) = -3a(n-1) + 5a(n-2), n > 1; a(0)=1, a(1)=-5.