23236

Appears in sequences

• Sequence arising in search for Legendre sequences.at n=17A039795
• Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.at n=63A055450
• a(n) = T(n,n-2), array T as in A055450.at n=8A055452
• a(n) = (2*n - 1)*(11*n^2 - 11*n + 6)/6.at n=18A063492
• Sum array of Catalan numbers (A000108) read by upward antidiagonals.at n=48A106534
• Number of n X n binary arrays symmetric under 90-degree rotation with all ones connected only in a 1 X 5 or 5 X 1 block.at n=15A145970
• Number of n X 2 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=44A239852
• a(n) = Sum_{k=0..n} binomial(n-3,n-k)*Catalan(k).at n=9A277969
• Triangle A106534 with reversed rows.at n=51A280470
• G.f.: Product_{k>=1, j>=1} 1/(1 - x^(j*k^3)).at n=36A280661
• The number of integers k less than 2^n whose decimal representation of their reciprocals has an odd period.at n=17A284904
• G.f. satisfies A(x) = x + Product_{n>=2} A(x^n) with A(0) = 1.at n=42A385635