25953

Appears in sequences

• The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=43A005576
• Triangular polyominoes (n-iamonds) without bilateral symmetry (holes are allowed).at n=13A030224
• Integer part of log(n^n)^(1 + log(1 + log(n))).at n=22A062449
• Nearest integer to log(n^n)^(1 + log(1 + log(n))).at n=22A062450
• Number of 0..n arrays x(0..4) of 5 elements without any two consecutive increases or two consecutive decreases.at n=7A200840
• Number of nX3 0..2 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=5A223019
• T(n,k)=Number of nXk 0..2 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=30A223022
• T(n,k)=Number of nXk 0..2 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=33A223022
• E.g.f.: sec(x)^3+(sec(x)^2*tan(x)).at n=8A225688
• Solution of the complementary equation a(n) = a(n-1) + a(n-3) + a(n-4) + b(n-2), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4, b(0) = 5, b(1) = 6, b(2) = 7, b(3) = 8, and (a(n)) and (b(n)) are increasing complementary sequences.at n=19A295756
• a(n) = 2*a(n-1) - a(n-3) + a(ceiling(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=19A298404
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=7A303177
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=52A303182
• A(n, k) = (m*k)! [x^k] MittagLefflerE(m, x)^(-n), for m = 2, n >= 0, k >= 0; square array read by descending antidiagonals.at n=31A326327
• a(n) = (2*n)! [x^(2*n)] cosh(x)^(-3).at n=4A326328
• Square array read by descending antidiagonals. T(n,k) is the number of ways to factor a permutation of [2n] into exactly k good factors, n>=0, k>=0.at n=32A341268