64256

Appears in sequences

• Expansion of (1+sin(x)+sin(x)^2)/(1-sin(x)+sin(x)^2).at n=8A029589
• Octanacci numbers: a(0)=a(1)=...=a(6)=0, a(7)=1; for n >= 8, a(n) = Sum_{i=1..8} a(n-i).at n=24A079262
• Lower triangular matrix T, read by rows, such that T(n,0) = 1 and T(n,k) = T(n-1,k) + T^2(n-1,k-1) for k>0, where T^2 is the matrix square of T.at n=52A097712
• Half the number of permutations of 0..n with exactly two maxima.at n=9A100575
• Triangle T(n, k) = 2^(k-1) * E(n, k-1) where E(n,k) are the Eulerian numbers A173018, read by rows.at n=43A142075
• T(n, k) = E(n, k)*2^k where E(n,k) are the Eulerian numbers A173018, for n > 0 and 0 <= k <= n-1, additionally T(0,0) = 1.at n=44A156365
• A complex matrix self-similar coefficient set of the imaginary part based on the Hadamard matrix pattern: {{1,1},{1,I}}.at n=22A158566
• If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 11. See A159741 for details.at n=6A159748
• a(n) = ((4+sqrt(5))*(3+sqrt(5))^n + (4-sqrt(5))*(3-sqrt(5))^n)/2.at n=6A163071
• Number of n X n 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=6A223771
• Number of nX7 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=6A223776
• Number of (n+2)X6 0..1 matrices with each 3X3 subblock having the same population.at n=4A224647
• Number of (n+2)X7 0..1 matrices with each 3X3 subblock having the same population.at n=3A224648
• T(n,k)=Number of (n+2)X(k+2) 0..1 matrices with each 3X3 subblock having the same population.at n=31A224651
• T(n,k)=Number of (n+2)X(k+2) 0..1 matrices with each 3X3 subblock having the same population.at n=32A224651
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 99", based on the 5-celled von Neumann neighborhood.at n=16A285823
• Triangle read by rows: T(n,k) (n >= 5, 4 <= k <= n-1) = number of lattice 3-polytopes of width larger than 1, size n, and k vertices.at n=24A319958
• 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=40A326327
• 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=40A341268
• Number of compositions (ordered partitions) of n into parts not greater than n/2.at n=17A368484