cp's OEIS Frontend

The recurrence relation RR(n) = 0 of the n-th right hand column can be found with RR(n) = expand( product((1-(2*k-1)^2*z)^(n-k+1),k=1..n),z) = 0 and replacing z^p by a(n-p).

The polynomials in the numerators of the generating functions GF(z) of the coefficients that precede the a(n), a(n-1), a(n-2) and a(n-3) sequences, see A000012, A006324, A162012 and A162013, are symmetrical. This phenomenon leads to the sequence [1, 1, 6, 1, 19, 492, 1218, 492, 19 , 9, 3631, 115138, 718465, 1282314, 718465, 115138, 3631, 9].

The a(n) are the sums of the coefficients of the polynomials that appear in the numerators of the o.g.f.s. of the right hand columns of the EG1 triangle A162005, see the examples.

Number of Joyce trees with 2n-1 nodes. Number of tremolo permutations of {0,1,...,2n}. - Ralf Stephan, Mar 28 2003

The Hankel transform of this sequence is A000178(n) for n odd = 1, 12, 34560, ...; example: det([1, 2, 16; 2, 16, 272, 16, 272, 7936]) = 34560. - Philippe Deléham, Mar 07 2004

a(n) is the number of increasing labeled full binary trees with 2n-1 vertices. Full binary means every non-leaf vertex has two children, distinguished as left and right; labeled means the vertices are labeled 1,2,...,2n-1; increasing means every child has a label greater than its parent. - David Callan, Nov 29 2007

From Micha Hofri (hofri(AT)wpi.edu), May 27 2009: (Start)

a(n) was found to be the number of permutations of [2n] which when inserted in order, to form a binary search tree, yield the maximally full possible tree (with only one single-child node).

The e.g.f. is sec^2(x)=1+tan^2(x), and the same coefficients can be manufactured from the tan(x) itself, which is the e.g.f. for the number of trees as above for odd number of nodes. (End)

a(n) is the number of increasing strict binary trees with 2n-1 nodes. For more information about increasing strict binary trees with an associated permutation, see A245894. - Manda Riehl, Aug 07 2014

For relations to alternating permutations, Euler and Bernoulli polynomials, zigzag numbers, trigonometric functions, Fourier transform of a square wave, quantum algebras, and integrals over and in n-dimensional hypercubes and over Green functions, see Hodges and Sukumar. For further discussion on the quantum algebra, see the later Hodges and Sukumar reference and the paper by Hetyei presenting connections to the general combinatorial theory of Viennot on orthogonal polynomials, inverse polynomials, tridiagonal matrices, and lattice paths (thereby related to continued fractions and cumulants). - Tom Copeland, Nov 30 2014

The Zigzag Hankel transform is A000178. That is, A000178(2*n - k) = det( [a(i+j - k)]{i,j = 1..n} ) for n>0 and k=0,1. - _Michael Somos, Mar 12 2015

a(n) is the number of standard Young tableaux of skew shape (n,n,n-1,n-2,...,3,2)/(n-1,n-2,n-3,...,2,1). - Ran Pan, Apr 10 2015

For relations to the Sheffer Appell operator calculus and a Riccati differential equation for generating the Meixner-Pollaczek and Krawtchouk orthogonal polynomials, see page 45 of the Feinsilver link and Rzadkowski. - Tom Copeland, Sep 28 2015

For relations to an elliptic curve, a Weierstrass elliptic function, the Lorentz formal group law, a Lie infinitesimal generator, and the Eulerian numbers A008292, see A155585. - Tom Copeland, Sep 30 2015

Absolute values of the alternating sums of the odd-numbered rows (where the single 1 at the apex of the triangle is counted as row #1) of the Eulerian triangle, A008292. The actual alternating sums alternate in sign, e.g., 1, -2, 16, -272, etc. (Even-numbered rows have alternating sums always 0.) - Gregory Gerard Wojnar, Sep 28 2018

The sequence is periodic modulo any odd prime p. The minimal period is (p-1)/2 if p == 1 mod 4 and p-1 if p == 3 mod 4 [Knuth & Buckholtz, 1967, Theorem 1]. - Allen Stenger, Aug 03 2020

From Peter Bala, Dec 24 2021: (Start)

Conjectures:

1) The sequence taken modulo any integer k eventually becomes periodic with period dividing phi(k).

2) The Gauss congruences a(n*p^k) == a(n*p^(k-1)) ( mod p^k ) hold for all prime p and positive integers n and k, except when p = 2, n = 1 and k = 1 or 2.

3) For i >= 1 define a_i(n) = a(n+i). The Gauss congruences a_i(n*p^k) == a_i(n*p^(k-1)) ( mod p^k ) hold for all prime p and positive integers n and k. If true, then for each i >= 1 the expansion of exp(Sum_{n >= 1} a_i(n)*x^n/n) has integer coefficients. For an example, see A262145.(End)

a(n) is the determinant of M(2n+1) where M(k) is the k X k matrix with m(i,j)=j if i+j=k m(i,j)=i otherwise. - Adapted to offset 0, Rainer Rosenthal, Jun 19 2024

In the following two comments on the calculation of the terms using permanents, offset 1 is assumed. In the corresponding PARI code, this is implemented with offset 0. - Hugo Pfoertner, Jun 23 2024

(-1)^n*a(n)/2^(2n-1) is the permanent of the (m X m) matrix {1/(x_i-y_j), 1<=i<=m, 1<=j<=m}, where x_1,x_2,...,x_m are the zeros of x^m-1 and y_1,y_2,...,y_m the zeros of y^m+1 and m=2n-1.

In 1881, R. F. Scott posed a conjecture that the absolute value of permanent of square matrix with elements a(i,j)= (x_i - y_j)^(-1), where x_1,...,x_n are roots of x^n=1, while y_1,...,y_n are roots of y^n=-1, equals a((n-1)/2)/2^n, if n>=1 is odd, and 0, if n>=2 is even. After a century (in 1979), the conjecture was proved by H. Minc. - Vladimir Shevelev, Dec 01 2013

a(n) is the number of permutations in S_{2n+1} in which all cycles have odd length. - José H. Nieto S., Jan 09 2012

Number of 3-bundled increasing bilabeled trees with 2n labels. - Markus Kuba, Nov 18 2014

a(n) is the number of rooted, binary, leaf-labeled topologies with 2n+2 leaves that have n+1 cherry nodes. - Noah A Rosenberg, Feb 12 2019

Essentially the same as A185411. Row reverse of A185410. - Peter Bala, Jul 24 2012

The SF(z; n) formulas, see below, were discovered while studying certain properties of the Dirichlet eta function.

From Peter Bala, Apr 03 2011: (Start)

Let D be the differential operator 2*x*d/dx. The row polynomials of this table come from repeated application of the operator D to the function g(x) = 1/sqrt(1 - x). For example,

D(g) = x*g^3

D^2(g) = x*(2 + x)*g^5

D^3(g) = x*(4 + 10*x + x^2)*g^7

D^4(g) = x*(8 + 60*x + 36*x^2 + x^3)*g^9.

Thus this triangle is analogous to the triangle of Eulerian numbers A008292, whose row polynomials come from the repeated application of the operator x*d/dx to the function 1/(1 - x). (End)