48501

Appears in sequences

• a(n) = Fibonacci(2*n+1) + 2*Fibonacci(2*n-1) - 2^n - [n = 0], where [b] is the Iverson bracket of b.at n=11A084086
• G.f.: Sum_{n>=0} x^n * (d/dx)^(n^2) x^(n^2) * (1+x)^n / (n^2)!, where (d/dx)^k denotes the k-th derivative operator.at n=8A264416
• Number of nX3 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=5A278773
• Number of nX6 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=2A278776
• T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=30A278778
• T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=33A278778