A034807 -id:A034807 - cp's OEIS frontend

A115140 O.g.f. inverse of Catalan A000108 o.g.f.

1, -1, -1, -2, -5, -14, -42, -132, -429, -1430, -4862, -16796, -58786, -208012, -742900, -2674440, -9694845, -35357670, -129644790, -477638700, -1767263190, -6564120420, -24466267020, -91482563640, -343059613650, -1289904147324, -4861946401452, -18367353072152

Offset: 0

Wolfdieter Lang, Jan 13 2006

Seiichi Manyama, Table of n, a(n) for n = 0..1668
Paul Barry, On a Central Transform of Integer Sequences, arXiv:2004.04577 [math.CO], 2020.
Paul Barry, Centered polygon numbers, heptagons and nonagons, and the Robbins numbers, arXiv:2104.01644 [math.CO], 2021.
Ângela Mestre and José Agapito, A Family of Riordan Group Automorphisms, J. Int. Seq., Vol. 22 (2019), Article 19.8.5.

See A034807 and A115149 for comments.

For convolutions of this sequence see A115141-A115149.

O.g.f.: 1/c(x) = 1-x*c(x) with the o.g.f. c(x):=(1-sqrt(1-4*x))/(2*x) of A000108 (Catalan numbers).
a(0) = 1, a(n) = -C(n-1), n>=1, with C(n):=A000108(n) (Catalan).
G.f.: (1 + sqrt(1-4*x))/2=U(0) where U(k)=1 - x/U(k+1) ; (continued fraction, 1-step). - Sergei N. Gladkovskii, Oct 29 2012
G.f.: 1/G(0) where G(k) = 1 - x/(x - 1/G(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Dec 12 2012
G.f.: G(0), where G(k)= 2*x*(2*k+1) + k + 1 - 2*x*(k+1)*(2*k+3)/G(k+1) ; (continued fraction). - Sergei N. Gladkovskii, Jul 14 2013
D-finite with recurrence n*a(n) +2*(-2*n+3)*a(n-1)=0. a(n) = A002420(n)/2, n>0. - R. J. Mathar, Aug 09 2015
a(n) ~ -2^(2*n-2) / (sqrt(Pi)*n^(3/2)). - Vaclav Kotesovec, May 06 2021

A115141 Convolution of A115140 with itself.

Original entry on oeis.org

1, -2, -1, -2, -5, -14, -42, -132, -429, -1430, -4862, -16796, -58786, -208012, -742900, -2674440, -9694845, -35357670, -129644790, -477638700, -1767263190, -6564120420, -24466267020, -91482563640, -343059613650, -1289904147324, -4861946401452, -18367353072152

Offset: 0

Wolfdieter Lang, Jan 13 2006

This is the so-called A-sequence for the Riordan triangles A053122, A110162, A129818, A158454 and signed A158909. For the notion of Z- and A-sequences for Riordan arrays see the W. Lang link under A006232 with details and references. Wolfdieter Lang, Dec 20 2010. [Revised, Nov 13 2012, Nov 22 2012 and Oct 22 2019]

a(n)*(-1)^n is the A-sequence for the Riordan triangle A111125. - Wolfdieter Lang, Jun 26 2011

			G.f. = 1 - 2*x - x^2 - 2*x^3 - 5*x^4 - 14*x^5 - 42*x^6 - 132*x^7 - 429*x^8 + ...

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

Cf. A000108, A115140, A115142 - A115149.

m:=30; R:=PowerSeriesRing(Rationals(), m); Coefficients(R!( (1-2*x+Sqrt(1-4*x))/2 )); // G. C. Greubel, Feb 12 2019

a[n_] := -First[ ListConvolve[ cc = Array[ CatalanNumber, n-1, 0], cc]]; a[0] = 1; a[1] = -2; Table[a[n], {n, 0, 27}] (* Jean-François Alcover, Oct 21 2011 *)
CoefficientList[Series[(1-2*x+Sqrt[1-4*x])/2, {x, 0, 30}], x] (* G. C. Greubel, Feb 12 2019 *)

{a(n) = if( n<1, n==0, -(n==1) -binomial( 2*n-2, n-1) / n)} /* Michael Somos, Mar 28 2012 */

((1-2*x+sqrt(1-4*x))/2).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Feb 12 2019

O.g.f.: 1/c(x)^2 = (1-x) - x*c(x) with the o.g.f. c(x) = (1-sqrt(1-4*x) )/(2*x) of A000108 (Catalan numbers).
a(0)=1, a(1)=-2, a(n) = -C(n-1), n>=2, with C(n):=A000108(n) (Catalan). The start [1, -2] is row n=2 of signed A034807 (signed Lucas polynomials). See A115149 and A034807 for comments.
The convolution inverse is A000108(x)^2. - Michael Somos, Mar 28 2012
REVERT transform is A069271. - Michael Somos, Mar 28 2012
EULER transform of -A060165. - Michael Somos, Mar 28 2012
D-finite with recurrence: n*a(n) +2*(-2*n+3)*a(n-1)=0. - R. J. Mathar, Feb 21 2020

A132460 Irregular triangle read by rows of the initial floor(n/2) + 1 coefficients of 1/C(x)^n, where C(x) is the g.f. of the Catalan sequence (A000108).

Original entry on oeis.org

1, 1, 1, -2, 1, -3, 1, -4, 2, 1, -5, 5, 1, -6, 9, -2, 1, -7, 14, -7, 1, -8, 20, -16, 2, 1, -9, 27, -30, 9, 1, -10, 35, -50, 25, -2, 1, -11, 44, -77, 55, -11, 1, -12, 54, -112, 105, -36, 2, 1, -13, 65, -156, 182, -91, 13, 1, -14, 77, -210, 294, -196, 49, -2

Offset: 0

Paul D. Hanna, Aug 21 2007

The length of row n is A008619(n).
Essentially equals a signed version of A034807, the triangle of Lucas polynomials. The initial n coefficients of 1/C(x)^n consist of row n followed by floor((n-1)/2) zeros for n > 0.
For the following formula for 1/C(x)^n see the W. Lang reference, proposition 1 on p. 411:
1/C(x)^n = (sqrt(x))^n*(S(n,1/sqrt(x)) - sqrt(x)*S(n-1,1/sqrt(x))*C(x)), n >= 0, with the Chebyshev polynomials S(n,x) with coefficients given in A049310. See also the coefficient array A115139 for P(n,x) = (sqrt(x)^(n-1))*S(n-1, 1/sqrt(x)). - Wolfdieter Lang, Sep 14 2013
This triangular array is composed of interleaved rows of reversed, A127677 (cf. A156308, A217476, A263916) and reversed, signed A111125. - Tom Copeland, Nov 07 2015
It seems that the n-th row lists the coefficients of the HOMFLYPT (HOMFLY) polynomial reduced to one variable for link family n, see Jablan's slide 38. - Andrey Zabolotskiy, Jan 16 2018
For n >= 1 row n gives the coefficients of the Girard-Waring formula for the sum of x1^n + x2^n in terms of the elementary symmetric functions e_1(x1,x2) = x1 + x2 and e_2(x1,x2) = x1*x2. This is an array using the partitions of n, in the reverse Abramowitz-Stegun order, with all partitions with parts larger than 2 eliminated. E.g., n = 4: x1^4 + x2^4 = 1*e1^4 - 4*e1^3*e2 + 2*e1*e2^2. See also A115131, row n = 4, with the mentioned partitions omitted. - Wolfdieter Lang, May 03 2019
Row n lists the coefficients of the n-th Faber polynomial for the replicable function given in A154272 with offset -1. - Ben Toomey, May 12 2020

			The irregular triangle T(n,k) begins:
n\k 0    1    2    3    4    5    6   7 ...
-------------------------------------------------
0:  1
1:  1
2:  1   -2
3:  1   -3
4:  1   -4    2
5:  1   -5    5
6:  1   -6    9   -2
7:  1   -7   14   -7
8:  1   -8   20  -16    2
9:  1   -9   27  -30    9
10: 1  -10   35  -50   25   -2
11: 1  -11   44  -77   55  -11
12: 1  -12   54 -112  105  -36    2
13: 1  -13   65 -156  182  -91   13
14: 1  -14   77 -210  294 -196   49  -2
... (reformatted - _Wolfdieter Lang_, May 03 2019)

Michael De Vlieger, Table of n, a(n) for n = 0..10200 (rows 0 <= n <= 200, flattened)
Tom Copeland, Addendum to Elliptic Lie Triad
G. Dattoli, E. Di Palma and E. Sabia, Cardan Polynomials, Chebyshev Exponents, Ultra-Radicals and Generalized Imaginary Units, Advances in Applied Clifford Algebras, 2014.
Pentti Haukkanen, Jorma Merikoski and Seppo Mustonen, Some polynomials associated with regular polygons, Acta Univ. Sapientiae, Mathematica, 6, 2 (2014) 178-193.
S. Jablan, Knots, computers, conjectures
Wolfdieter Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38 (2000) 408-419. Eq. (23) with n -> -n and eq. (20).
Jorma K. Merikoski, Regular polygons, Morgan-Voyce polynomials, and Chebyshev polynomials, Notes on Num. Theor. and Disc. Math. (2021) Vol. 27, No. 2, 79-87.

Cf. A000108, A008619, A034807 (Lucas polynomials), A111125, A115131 (Waring numbers), A127677, A132461 (row squared sums), A156308, A217476, A263916.

T[0, 0] = 1; T[n_, k_] := (-1)^k (Binomial[n-k, k] + Binomial[n-k-1, k-1]);
Table[T[n, k], {n, 0, 14}, {k, 0, n/2}] // Flatten (* Jean-François Alcover, Jun 04 2018 *)

{T(n,k)=if(k>n\2,0,(-1)^k*(binomial(n-k, k)+binomial(n-k-1, k-1)))}

T(n,k) = (-1)^k*( C(n-k,k) + C(n-k-1,k-1) ) for n >= 0, 0 <= k <= floor(n/2).

T(0,0) = 1; T(n,k) = (-1)^k*n*binomial(n-k,k)/(n-k), k = 0..floor(n/2). - Wolfdieter Lang, May 03 2019

A115149 Tenth convolution of A115140.

Original entry on oeis.org

1, -10, 35, -50, 25, -2, 0, 0, 0, 0, -1, -10, -65, -350, -1700, -7752, -33915, -144210, -600875, -2466750, -10015005, -40320150, -161280600, -641886000, -2544619500, -10056336264, -39645171810, -155989499540, -612815891050, -2404551645100, -9425842448792

Offset: 0

Wolfdieter Lang, Jan 13 2006

Because (x*c(x))^n + (1/c(x))^n = L(n,-x)= Sum_{k=0..floor(n/2)} A034807(n,k)*(-x)^k the sequence starts with the Lucas polynomial L(10,-x) (of degree 5).

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

Cf. A003519, A115139 - A115148.

m:=30; R:=PowerSeriesRing(Rationals(), m); Coefficients(R!( (1-10*x+35*x^2-50*x^3+25*x^4-2*x^5 +(1-8*x+21*x^2 -20*x^3+5*x^4 )*Sqrt(1-4*x))/2 )); // G. C. Greubel, Feb 12 2019

CoefficientList[Series[(1-10*x+35*x^2-50*x^3+25*x^4-2*x^5 +(1-8*x+21*x^2 -20*x^3+5*x^4)*Sqrt[1-4*x])/2, {x, 0, 30}], x] (* G. C. Greubel, Feb 12 2019 *)

my(x='x+O('x^30)); Vec((1-10*x+35*x^2-50*x^3+25*x^4-2*x^5 +(1-8*x +21*x^2 -20*x^3+5*x^4)*sqrt(1-4*x))/2) \\ G. C. Greubel, Feb 12 2019

((1-10*x+35*x^2-50*x^3+25*x^4-2*x^5 +(1-8*x+21*x^2 -20*x^3+5*x^4) *sqrt(1-4*x))/2).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Feb 12 2019

O.g.f.: 1/c(x)^10 = P(11, x) - x*P(10, x)*c(x) with the o.g.f. c(x):=(1-sqrt(1-4*x))/(2*x) of A000108 (Catalan numbers) and the polynomials P(n, x) defined in A115139. Here P(11, x) = 1 - 9*x + 28*x^2 - 35*x^3 + 15*x^4 - x^5 and P(10, x) = 1 - 8*x + 21*x^2 - 20*x^3 + 5*x^4.
a(n) = -C10(n-10), n >= 10, with C10(n) = (n+4) (eighth convolution of Catalan numbers). a(0)=1, a(1)=-10, a(2)=35, a(3)=-50, a(4)=25, a(5)=-2, a(6)=a(7)=a(8)=a(9)=0. [1, -10, 35, -50, 25, -2] is row n=10 of signed A034807 (signed Lucas polynomials).
a(n) ~ -5 * 2^(2*n - 10) / (sqrt(Pi) * n^(3/2)). - Vaclav Kotesovec, Feb 13 2019

A374439 Triangle read by rows: the coefficients of the Lucas-Fibonacci polynomials. T(n, k) = T(n - 1, k) + T(n - 2, k - 2) with initial values T(n, k) = k + 1 for k < 2.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 2, 3, 4, 1, 1, 2, 4, 6, 3, 2, 1, 2, 5, 8, 6, 6, 1, 1, 2, 6, 10, 10, 12, 4, 2, 1, 2, 7, 12, 15, 20, 10, 8, 1, 1, 2, 8, 14, 21, 30, 20, 20, 5, 2, 1, 2, 9, 16, 28, 42, 35, 40, 15, 10, 1, 1, 2, 10, 18, 36, 56, 56, 70, 35, 30, 6, 2

Offset: 0

Peter Luschny, Jul 22 2024

There are several versions of Lucas and Fibonacci polynomials in this database. Our naming follows the convention of calling polynomials after the values of the polynomials at x = 1. This assumes a regular sequence of polynomials, that is, a sequence of polynomials where degree(p(n)) = n. This view makes the coefficients of the polynomials (the terms of a row) a refinement of the values at the unity.
A remarkable property of the polynomials under consideration is that they are dual in this respect. This means they give the Lucas numbers at x = 1 and the Fibonacci numbers at x = -1 (except for the sign). See the example section.
The Pell numbers and the dual Pell numbers are also values of the polynomials, at the points x = -1/2 and x = 1/2 (up to the normalization factor 2^n). This suggests a harmonized terminology: To call 2^n*P(n, -1/2) = 1, 0, 1, 2, 5, ... the Pell numbers (A000129) and 2^n*P(n, 1/2) = 1, 4, 9, 22, ... the dual Pell numbers (A048654).
Based on our naming convention one could call A162515 (without the prepended 0) the Fibonacci polynomials. In the definition above only the initial values would change to: T(n, k) = k + 1 for k < 1. To extend this line of thought we introduce A374438 as the third triangle of this family.
The triangle is closely related to the qStirling2 numbers at q = -1. For the definition of these numbers see A333143. This relates the triangle to A065941 and A103631.

			Triangle starts:
  [ 0] [1]
  [ 1] [1, 2]
  [ 2] [1, 2, 1]
  [ 3] [1, 2, 2,  2]
  [ 4] [1, 2, 3,  4,  1]
  [ 5] [1, 2, 4,  6,  3,  2]
  [ 6] [1, 2, 5,  8,  6,  6,  1]
  [ 7] [1, 2, 6, 10, 10, 12,  4,  2]
  [ 8] [1, 2, 7, 12, 15, 20, 10,  8,  1]
  [ 9] [1, 2, 8, 14, 21, 30, 20, 20,  5,  2]
  [10] [1, 2, 9, 16, 28, 42, 35, 40, 15, 10, 1]
.
Table of interpolated sequences:
  |  n | A039834 & A000045 | A000032 |   A000129   |   A048654  |
  |  n |     -P(n,-1)      | P(n,1)  |2^n*P(n,-1/2)|2^n*P(n,1/2)|
  |    |     Fibonacci     |  Lucas  |     Pell    |    Pell*   |
  |  0 |        -1         |     1   |       1     |       1    |
  |  1 |         1         |     3   |       0     |       4    |
  |  2 |         0         |     4   |       1     |       9    |
  |  3 |         1         |     7   |       2     |      22    |
  |  4 |         1         |    11   |       5     |      53    |
  |  5 |         2         |    18   |      12     |     128    |
  |  6 |         3         |    29   |      29     |     309    |
  |  7 |         5         |    47   |      70     |     746    |
  |  8 |         8         |    76   |     169     |    1801    |
  |  9 |        13         |   123   |     408     |    4348    |

Paolo Xausa, Rows n = 0..150 of the triangle, flattened
Peter Luschny, Illustrating the polynomials.

Triangles related to Lucas polynomials: A034807, A114525, A122075, A061896, A352362.
Triangles related to Fibonacci polynomials: A162515, A053119, A168561, A049310, A374441.
Sums include: A000204 (Lucas numbers, row), A000045 & A212804 (even sums, Fibonacci numbers), A006355 (odd sums), A039834 (alternating sign row).
Type m^n*P(n, 1/m): A000129 & A048654 (Pell, m=2), A108300 & A003688 (m=3), A001077 & A048875 (m=4).
Adding and subtracting the values in a row of the table (plus halving the values obtained in this way): A022087, A055389, A118658, A052542, A163271, A371596, A324969, A212804, A077985, A069306, A215928.
Columns include: A040000 (k=1), A000027 (k=2), A005843 (k=3), A000217 (k=4), A002378 (k=5).
Diagonals include: A000034 (k=n), A029578 (k=n-1), abs(A131259) (k=n-2).
Cf. A029578 (subdiagonal), A124038 (row reversed triangle, signed).
Cf. A039961, A065941 (qStirling2), A103631, A108299, A131259. A133607, A194005, A333143, A374438 (m=3).

function T(n,k) // T = A374439
  if k lt 0 or k gt n then return 0;
  elif k le 1 then return k+1;
  else return T(n-1,k) + T(n-2,k-2);
  end if;
end function;
[T(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Jan 23 2025

A374439 := (n, k) -> ifelse(k::odd, 2, 1)*binomial(n - irem(k, 2) - iquo(k, 2), iquo(k, 2)):
# Alternative, using the function qStirling2 from A333143:
T := (n, k) -> 2^irem(k, 2)*qStirling2(n, k, -1):
seq(seq(T(n, k), k = 0..n), n = 0..10);

A374439[n_, k_] := (# + 1)*Binomial[n - (k + #)/2, (k - #)/2] & [Mod[k, 2]];
Table[A374439[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* Paolo Xausa, Jul 24 2024 *)

from functools import cache
@cache
def T(n: int, k: int) -> int:
    if k > n: return 0
    if k < 2: return k + 1
    return T(n - 1, k) + T(n - 2, k - 2)

from math import comb as binomial
def T(n: int, k: int) -> int:
    o = k & 1
    return binomial(n - o - (k - o) // 2, (k - o) // 2) << o

def P(n, x):
    if n < 0: return P(n, x)
    return sum(T(n, k)*x**k for k in range(n + 1))
def sgn(x: int) -> int: return (x > 0) - (x < 0)
# Table of interpolated sequences
print("|  n | A039834 & A000045 | A000032 |   A000129   |   A048654  |")
print("|  n |     -P(n,-1)      | P(n,1)  |2^n*P(n,-1/2)|2^n*P(n,1/2)|")
print("|    |     Fibonacci     |  Lucas  |     Pell    |    Pell*   |")
f = "| {0:2d} | {1:9d}         |  {2:4d}   |   {3:5d}     |    {4:4d}    |"
for n in range(10): print(f.format(n, -P(n, -1), P(n, 1), int(2**n*P(n, -1/2)), int(2**n*P(n, 1/2))))

from sage.combinat.q_analogues import q_stirling_number2
def A374439(n,k): return (-1)^((k+1)//2)*2^(k%2)*q_stirling_number2(n+1, k+1, -1)
print(flatten([[A374439(n, k) for k in range(n+1)] for n in range(13)])) # G. C. Greubel, Jan 23 2025

T(n, k) = 2^k' * binomial(n - k' - (k - k') / 2, (k - k') / 2) where k' = 1 if k is odd and otherwise 0.
T(n, k) = (1 + (k mod 2))*qStirling2(n, k, -1), see A333143.
2^n*P(n, -1/2) = A000129(n - 1), Pell numbers, P(-1) = 1.
2^n*P(n, 1/2) = A048654(n), dual Pell numbers.
T(2*n, n) = (1/2)*(-1)^n*( (1+(-1)^n)*A005809(n/2) - 2*(1-(-1)^n)*A045721((n-1)/2) ). - G. C. Greubel, Jan 23 2025

A162514 Triangle of coefficients of polynomials defined by the Binet form P(n,x) = U^n + L^n, where U = (x + d)/2, L = (x - d)/2, d = (4 + x^2)^(1/2). Decreasing powers of x.

Original entry on oeis.org

2, 1, 0, 1, 0, 2, 1, 0, 3, 0, 1, 0, 4, 0, 2, 1, 0, 5, 0, 5, 0, 1, 0, 6, 0, 9, 0, 2, 1, 0, 7, 0, 14, 0, 7, 0, 1, 0, 8, 0, 20, 0, 16, 0, 2, 1, 0, 9, 0, 27, 0, 30, 0, 9, 0, 1, 0, 10, 0, 35, 0, 50, 0, 25, 0, 2, 1, 0, 11, 0, 44, 0, 77, 0, 55, 0, 11, 0, 1, 0, 12, 0, 54, 0, 112, 0, 105, 0, 36, 0, 2, 1, 0, 13, 0

Offset: 0

Clark Kimberling, Jul 05 2009

For a signed version of this triangle corresponding to the row reversed version of the triangle A127672 see A244422. - Wolfdieter Lang, Aug 07 2014

The row reversed triangle is A114525. - Paolo Bonzini, Jun 23 2016

			Triangle begins
   2;  == 2
   1, 0;  == x + 0
   1, 0,  2;  == x^2 + 2
   1, 0,  3, 0;  == x^3 + 3*x + 0
   1, 0,  4, 0,  2;
   1, 0,  5, 0,  5, 0;
   1, 0,  6, 0,  9, 0,  2;
   1, 0,  7, 0, 14, 0,  7, 0;
   1, 0,  8, 0, 20, 0, 16, 0,  2;
   1, 0,  9, 0, 27, 0, 30, 0,  9, 0;
   1, 0, 10, 0, 35, 0, 50, 0, 25, 0, 2;
   ...
From _Wolfdieter Lang_, Aug 07 2014: (Start)
The row polynomials R(n, x) are:
  R(0, x) = 2, R(1, x) = 1 =   x*P(1,1/x),  R(2, x) = 1 + 2*x^2 = x^2*P(2,1/x), R(3, x) = 1 + 3*x^2 = x^3*P(3,1/x), ...
(End)

G. C. Greubel, Rows n=0..100 of triangle, flattened

Cf. A000032, A114525, A162515, A162516, A162517.

Table[Reverse[CoefficientList[LucasL[n, x], x]], {n, 0, 12}]//Flatten  (* G. C. Greubel, Nov 05 2018 *)

P(n)=
{
    local(U, L, d, r, x);
    if ( n<0, return(0) );
    x = 'x+O('x^(n+1));
    d=(4 + x^2)^(1/2);
    U=(x+d)/2;  L=(x-d)/2;
    r = U^n+L^n;
    r = truncate(r);
    return( r );
}
for (n=0, 10, print(Vec(P(n))) ); /* show triangle */
/* Joerg Arndt, Jul 24 2011 */

P(n,x) = x*P(n-1,x) + P(n-2,x) for n >= 2, P(0,x) = 2, P(1,x) = x.
From Wolfdieter Lang, Aug 07 2014: (Start)
T(n,m) = [x^(n-m)] P(n,x), m = 0, 1, ..., n and  n >= 0.
G.f. of polynomials P(n,x): (2 - x*z)/(1 - x*z - z^2).
G.f. of row polynomials R(n,x) = Sum_{m=0..n} T(n,m)*x^m:  (2 - z)/(1 - z - (x*z)^2) (rows for P(n,x) reversed).
(End)
For n > 0, T(n,2*m+1) = 0, T(n,2*m) = A034807(n,m). - Paolo Bonzini, Jun 23 2016

Name clarified by Wolfdieter Lang, Aug 07 2014

A199969 a(n) = the greatest non-divisor h of n (1 < h < n), or 0 if no such h exists.

Original entry on oeis.org

0, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75

Offset: 1

Jaroslav Krizek, Nov 26 2011

From Paul Curtz, Feb 09 2015: (Start)
The nonnegative numbers with 0 instead of 1. See A254667(n), which is linked to the Bernoulli numbers A164555(n)/A027642(n), an autosequence of the second kind.
Offset 0 could be chosen.
An autosequence of the second kind is a sequence whose main diagonal is the first upper diagonal multiplied by 2. If the first upper diagonal is
s0, s1, s2, s3, s4, s5, ...,
the sequence is
Ssk(n) = 2*s0, s0, s0 + 2*s1, s0 +3*s1, s0 + 4*s1 + 2*s2, s1 + 5*s1 + 5*s2, etc.
The corresponding coefficients are A034807(n), a companion to A011973(n).
The binomial transform of Ssk(n) is (-1)^n*Ssk(n).
Difference table of a(n):
   0,  0, 2, 3, 4, 5, 6, 7, ...
   0,  2, 1, 1, 1, 1, 1, ...
   2, -1, 0, 0, 0, 0 ...
  -3,  1, 0, 0, 0, ...
   4, -1, 0, 0, ...
  -5,  1, 0, ...
   6, -1, ...
   7, ...
  etc.
a(n) is an autosequence of the second kind. See A054977(n).
The corresponding autosequence of the first kind (a companion) is 0, 0 followed by the nonnegative numbers (A001477(n)). Not in the OEIS.
Ssk(n) = 2*Sfk(n+1) - Sfk(n) where Sfk(n) is the corresponding sequence of the first kind (see A254667(n)).
(End)
Number of binary sequences of length n-1 that contain exactly one 0 and at least one 1. - Enrique Navarrete, May 11 2021

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

Cf. A199968 (the smallest non-divisor h of n (1A199970. A001477, A011973, A034807, A054977, A254667.
Cf. A007978.
Essentially the same as A000027, A028310, A087156 etc.

Join[{0,0},Table[Max[Complement[Range[n],Divisors[n]]],{n,3,70}]] (* or *) Join[{0,0},Range[2,70]] (* Harvey P. Dale, May 31 2014 *)

if(n>2,n-1,0) \\ Charles R Greathouse IV, Sep 02 2015

a(n) = n-1 for n >= 3.

E.g.f.: 1-x^2/2+(x-1)*exp(x). - Enrique Navarrete, May 11 2021

A355345 G.f.: Sum_{n=-oo..+oo} x^(n(n+1)/2) C(x)^(2n-1), where C(x) = 1 + xC(x)^2 is the g.f. of the Catalan numbers (A000108).

Original entry on oeis.org

2, -2, -5, 6, -7, 14, -6, -9, 27, -30, 10, -11, 44, -77, 55, -10, -13, 65, -156, 182, -91, 14, -15, 90, -275, 450, -378, 140, -14, -17, 119, -442, 935, -1122, 714, -204, 18, -19, 152, -665, 1729, -2717, 2508, -1254, 285, -18, -21, 189, -952, 2940, -5733, 7007, -5148, 2079, -385, 22, -23, 230, -1311, 4692, -10948, 16744, -16445, 9867, -3289, 506

Offset: 0

Paul D. Hanna, Jul 25 2022

sign

			G.f.: A(x) = 2 - 2*x - 5*x^2 + 6*x^3 - 7*x^4 + 14*x^5 - 6*x^6 - 9*x^7 + 27*x^8 - 30*x^9 + 10*x^10 - 11*x^11 + 44*x^12 - 77*x^13 + 55*x^14 - 10*x^15 - 13*x^16 + 65*x^17 - 156*x^18 + 182*x^19 - 91*x^20 + ...
such that
A(x) = ... + x^6/C(x)^9 + x^3/C(x)^7 + x/C(x)^5 + 1/C(x)^3 + 1/C(x) + x*C(x) + x^3*C(x)^3 + x^6*C(x)^5 + x^10*C(x)^7 + x^15*C(x)^9 + ... + x^(n*(n+1)/2) * C(x)^(2*n-1) + ...
also
A(x) = 1/C(x)^3 * (1 + C(x)^2)*(1 + x/C(x)^2)*(1-x) * (1 + x*C(x)^2)*(1 + x^2/C(x)^2)*(1-x^2) * (1 + x^2*C(x)^2)*(1 + x^3/C(x)^2)*(1-x^3) * (1 + x^3*C(x)^2)*(1 + x^4/C(x)^2)*(1-x^4) * ... * (1 + x^(n-1)*C(x)^2)*(1 + x^n/C(x)^2)*(1-x^n) * ...
where C(x) = 1 + x*C(x)^2 begins
C(x) = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 132*x^6 + 429*x^7 + 1430*x^8 + ... + A000108(n)*x^n + ...
RELATED TABLE.
This sequence also forms the antidiagonals of the rectangular table given by:
n = 0: [  2,  -5,  14,   -30,    55,    -91,    140,    -204, ...];
n = 1: [ -2,  -7,  27,   -77,   182,   -378,    714,   -1254, ...];
n = 2: [  6,  -9,  44,  -156,   450,  -1122,   2508,   -5148, ...];
n = 3: [ -6, -11,  65,  -275,   935,  -2717,   7007,  -16445, ...];
n = 4: [ 10, -13,  90,  -442,  1729,  -5733,  16744,  -44200, ...];
n = 5: [-10, -15, 119,  -665,  2940, -10948,  35700, -104652, ...];
n = 6: [ 14, -17, 152,  -952,  4692, -19380,  69768, -224808, ...];
n = 7: [-14, -19, 189, -1311,  7125, -32319, 127281, -447051, ...];
n = 8: [ 18, -21, 230, -1750, 10395, -51359, 219604, -834900, ...];
...
in which row n has g.f.: (-1)^n*(2*n+1) + (1-x)/(1+x)^(2*n+4) for n >= 0.
Thus, the terms of this sequence obey the rule
a((n+k)*(n+k+1)/2 + k) = [x^k] ((-1)^n*(2*n+1) + (1-x)/(1+x)^(2*n+4)), for n >= 0, k = 0..n.
Equivalently,
a((n+k)*(n+k+1)/2 + k) = (-1)^k*(binomial(2*n+k+3,k) + binomial(2*n+k+2,k-1)), for n >= 0, k >= 1, with a(n*(2*n+1)) = 2*(2*n+1) and a((n+1)*(2*n+1)) = -2*(2*n+1) for n >= 0.
For example,
a((n+1)*(n+2)/2 + 1) = -(2*n+5) for n >= 0,
a((n+2)*(n+3)/2 + 2) = (n+2)*(2*n+7) for n >= 0,
a(n*(n+3)/2) = (-1)^n * (n+1)*(n+2)*(2*n+3)/6  for n >= 1,
a(2*n*(n+1)) = (-1)^n * (binomial(3*n+3,n) + binomial(3*n+2,n-1)) = (-1)^n * A355347(n), for n >= 1.
...

Paul D. Hanna, Table of n, a(n) for n = 0..2555

Cf. A132460, A034807, A000108, A355341, A355342, A355346, A355347.

{a(n) = my(A,C=1/x*serreverse(x-x^2 +O(x^(n+2))),M=ceil(sqrt(2*n+9)));
A = sum(m=-M,M, x^(m*(m+1)/2) * C^(2*m-1) ); polcoeff(A,n)}
for(n=0,70,print1(a(n),", "))

{a(n) = my(A,M=ceil(sqrt(2*n+1)));
A = sum(m=0,M, sum(k=0,n-m*(m+1)/2, x^((m+k)*(m+k+1)/2 + k) * polcoeff( (-1)^m*(2*m+1) + (1-x)/(1+x +x^2*O(x^k))^(2*m+4) ,k) )); polcoeff(A,n)}
for(n=0,70,print1(a(n),", "))

G.f. A(x) = Sum_{n>=0} a(n)*x^n may be obtained from the following expressions; here, C(x) = 1 + x*C(x)^2 is the g.f. of the Catalan numbers (A000108).
(1) A(x) = Sum_{n=-oo..+oo} x^(n*(n+1)/2) * C(x)^(2*n-1).
(2) A(x) = Sum_{n>=0} x^(n*(n+1)/2) * (C(x)^(2*n-1) + 1/C(x)^(2*n+3)).
(3) A(x) = 1/C(x)^3 * Product_{n>=1} (1 + x^(n-1)*C(x)^2) * (1 + x^n/C(x)^2) * (1-x^n), by the Jacobi triple product identity.
(4) A(x) = 1/P(x)^3 + Sum_{n>=0} Sum_{k>=0} (-1)^k * (binomial(2*n+k+3,k) + binomial(2*n+k+2,k-1)) * x^((n+k)*(n+k+1)/2 + k), where P(x) = Product_{n>=1} 1/(1-x^n) is the partition function.
(5) a((n+k)*(n+k+1)/2 + k) = [x^k] (-1)^n*(2*n+1) + (1-x)/(1+x)^(2*n+4), for n >= 0, k >= 0.
(6) a((n+k)*(n+k+1)/2 + k) = (-1)^k*(binomial(2*n+k+3,k) + binomial(2*n+k+2,k-1)), for n >= 0, k >= 1.

A061896 Triangle of coefficients of Lucas polynomials.

Original entry on oeis.org

2, 1, 0, 1, 2, 0, 1, 3, 0, 0, 1, 4, 2, 0, 0, 1, 5, 5, 0, 0, 0, 1, 6, 9, 2, 0, 0, 0, 1, 7, 14, 7, 0, 0, 0, 0, 1, 8, 20, 16, 2, 0, 0, 0, 0, 1, 9, 27, 30, 9, 0, 0, 0, 0, 0, 1, 10, 35, 50, 25, 2, 0, 0, 0, 0, 0, 1, 11, 44, 77, 55, 11, 0, 0, 0, 0, 0, 0, 1, 12, 54, 112, 105, 36, 2, 0, 0, 0, 0, 0, 0, 1, 13

Offset: 0

Henry Bottomley, May 14 2001

			Triangle begins:
2,
1, 0.
1, 2, 0.
1, 3, 0, 0.
1, 4, 2, 0, 0.
1, 5, 5, 0, 0, 0.
1, 6, 9, 2, 0, 0, 0.

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Alternative version of A034807. With alternating signs, these are the coefficients of the recurrences in A061897.

a[0, 0] := 2; a[n_, 0] := 1; a[n_, n_] := 0; a[n_, k_] := Binomial[n - k, k]*n/(n - k); Table[a[n, k], {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Oct 15 2017 *)

a(n, k) = C(n-k, k)*n/(n-k).
a(n, k) = C(n-k, k) + C(n-k-1, k-1).
a(n, k) = a(n-1, k) + a(n-2, k-1) with a(n, 0)=1 if n>0 and a(0, 0)=2.

A115142 Third convolution of A115140.

Original entry on oeis.org

1, -3, 0, -1, -3, -9, -28, -90, -297, -1001, -3432, -11934, -41990, -149226, -534888, -1931540, -7020405, -25662825, -94287120, -347993910, -1289624490, -4796857230, -17902146600, -67016296620, -251577050010, -946844533674, -3572042254128, -13505406670700

Offset: 0

Wolfdieter Lang, Jan 13 2006

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

Cf. A000108, A000245, A071724.

Cf. A115139, A115140, A115141, A115143 - A115149.

m:=30; R:=PowerSeriesRing(Rationals(), m); Coefficients(R!( (2*(1-2*x)-(1-x)*(1-Sqrt(1-4*x)))/2 )); // G. C. Greubel, Feb 12 2019

CoefficientList[Series[(2*(1-2*x)-(1-x)*(1-Sqrt[1-4*x]))/2, {x, 0, 30}], x] (* G. C. Greubel, Feb 12 2019 *)

my(x='x+O('x^30)); Vec((2*(1-2*x)-(1-x)*(1-sqrt(1-4*x)))/2) \\ G. C. Greubel, Feb 12 2019

((2*(1-2*x)-(1-x)*(1-sqrt(1-4*x)))/2).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Feb 12 2019

O.g.f.: 1/c(x)^3 = P(4, x) - x*P(3, x)*c(x) with the o.g.f. c(x):=(1-sqrt(1-4*x))/(2*x) of A000108 (Catalan numbers) and the polynomials P(n, x) defined in A115139. Here P(4, x)=1-2*x and P(3, x)=1-x.
a(n) = -C3(n-3), n >= 3, with C3(n):= A000245(n+1) (third convolution of Catalan numbers). a(0)=1, a(1)=-3, a(2)=0. [1, -3] is the row n=3 of signed A034807 (signed Lucas polynomials). See A115149 and A034807 for comments.
D-finite with recurrence +n*(n-3)*a(n) -2*(n-2)*(2*n-5)*a(n-1)=0. - R. J. Mathar, Sep 23 2021
O.g.f.: (1/8)*(1 + sqrt(1 - 4*x))^3 = ( hypergeom([-1/4, -3/4], [-1/2], 4*x) )^2. - Peter Bala, Mar 04 2022

cp's OEIS Frontend

A115140 O.g.f. inverse of Catalan A000108 o.g.f.

Views

Author

Keywords

Links

Crossrefs

Formula

A115141 Convolution of A115140 with itself.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A132460 Irregular triangle read by rows of the initial floor(n/2) + 1 coefficients of 1/C(x)^n, where C(x) is the g.f. of the Catalan sequence (A000108).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A115149 Tenth convolution of A115140.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A374439 Triangle read by rows: the coefficients of the Lucas-Fibonacci polynomials. T(n, k) = T(n - 1, k) + T(n - 2, k - 2) with initial values T(n, k) = k + 1 for k < 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Python

Python

Python

SageMath

Formula

A162514 Triangle of coefficients of polynomials defined by the Binet form P(n,x) = U^n + L^n, where U = (x + d)/2, L = (x - d)/2, d = (4 + x^2)^(1/2). Decreasing powers of x.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A199969 a(n) = the greatest non-divisor h of n (1 < h < n), or 0 if no such h exists.

Views

Author

A355345 G.f.: Sum_{n=-oo..+oo} x^(n(n+1)/2) C(x)^(2n-1), where C(x) = 1 + xC(x)^2 is the g.f. of the Catalan numbers (A000108).