22096

Appears in sequences

• Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=19A063061
• Main diagonal of the quadruple recurrence x(i,j,k,m) = x(i-1,j,k,m) + x(i,j-1,k,m) + x(i,j,k-1,m) + x(i,j,k,m-1) with x(i,j,k,m) = 1 if 0 in {i,j,k,m}.at n=3A209288
• Number A(n,k) of paths starting at {n}^k to a border position where one component equals 0 using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=31A210472
• Number of paths starting at {3}^n to a border position where one component equals 0 using steps that decrement one component by 1.at n=4A210486
• Number of (n+5)X6 0..1 matrices with each 6X6 subblock idempotent.at n=4A224570
• Number of (n+5) X 10 0..1 matrices with each 6 X 6 subblock idempotent.at n=0A224574
• T(n,k)=Number of (n+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent.at n=10A224577
• T(n,k)=Number of (n+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent.at n=14A224577
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 241", based on the 5-celled von Neumann neighborhood.at n=30A270990
• a(n) = [x^n] Product_{k=1..n} ((1 + x^k)/(1 - x^k))^(n-k+1).at n=6A303483
• E.g.f.: exp( (x * (1 + x) * exp(x) - sinh(x)) / 4 ).at n=9A346749
• Least k such that A000668(n) + k is prime, where A000668(n) is the n-th Mersenne prime.at n=25A365160
• a(n) = Sum_{k=0..floor(n/4)} 2^(n-4*k) * binomial(2*n-6*k+1,2*k).at n=11A387693