26976

Appears in sequences

• a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=32A004949
• a(n) = ((6 + sqrt(8))^n + (6 - sqrt(8))^n)/2.at n=5A147688
• Number of binary strings of length n with equal numbers of 00011 and 00101 substrings.at n=16A164229
• Number of 4-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions.at n=30A187174
• Number of nX3 0..3 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=14A201446
• Sum of neighbor maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their king-move neighbors in a random 0..3 nX3 array.at n=4A221067
• Sum of neighbor maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their king-move neighbors in a random 0..3 nX5 array.at n=2A221069
• T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their king-move neighbors in a random 0..3 nXk array.at n=23A221072
• T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their king-move neighbors in a random 0..3 nXk array.at n=25A221072
• a(n) = (sigma(2*n) - sigma(n))*Lucas(n) where Lucas(n) = A000204(n) and sigma(n) = A000203(n) is the sum of divisors of n.at n=13A225525
• Number of length 2+2 0..n arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=14A253130
• Number of polygons formed when connecting all 4n points on the perimeter of an n X n square by infinite lines.at n=7A345459
• Triangle read by rows: Coefficients of the polynomials S2(n, x) * EZ(n, x), where S2 denote the Stirling set polynomials and EZ the Eulerian zig-zag polynomials A205497.at n=46A373428