26195

Appears in sequences

• Expansion of 1/(1 - 3*x + x^2)^2.at n=8A001871
• Denominators of continued fraction convergents to sqrt(743).at n=7A042431
• Expansion of (1+x^3*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=8A071729
• A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).at n=46A125662
• Number of 0's in even position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=19A129722
• a(n) = n^4 - n^3 - n^2.at n=13A132998
• Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+8*x+x^2)/(1-x)^4, read by rows.at n=31A166340
• Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+8*x+x^2)/(1-x)^4, read by rows.at n=32A166340
• Triangle, read by rows, given by [0,1/3,-1/3,0,0,0,0,0,0,0,...] DELTA [3,-1/3,1/3,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.at n=64A172249
• Triangle read by rows: T(n,k) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences of 01's (0 <= k <= floor(n/2)).at n=31A181371
• Triangle of coefficients of Chebyshev's S(n,x-3) polynomials (exponents of x in increasing order).at n=46A207815
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 721", based on the 5-celled von Neumann neighborhood.at n=26A273447
• Triangle read by rows: T(n,k) is the coefficient of x^k in the ZZ polynomial of the hexagonal graphene flake O(3,4,n).at n=26A338244
• Irregular triangle read by rows: T(n,k) is the number of unlabeled n-vertex hypergraphs (or set systems) with k hyperedges (none of which is empty), 0 <= k <= 2^n-1.at n=38A371830
• Irregular triangle read by rows: T(n,k) is the number of unlabeled n-vertex hypergraphs (or set systems) with k hyperedges (none of which is empty), 0 <= k <= 2^n-1.at n=55A371830