35868

Appears in sequences

• Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=9A196324
• Triangle read by rows: T(n,k) = (n+1-k)*|s(n,n+1-k)| - 2*|s(n-1,n-k)|, where s(n,k) are the signed Stirling numbers of the first kind and 1 <= k <= n.at n=33A199221
• Number of subsets of {1,2,...,n} with the sum of reciprocals <= 1.at n=18A212657
• Number of n X 2 0..1 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.at n=9A231538
• Number of (n+1) X (3+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235193
• Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235194
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=17A235198
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=18A235198
• Number of length 2+2 0..n arrays with no pair in any consecutive three terms totalling exactly n.at n=13A245997
• Convolution of nonzero squares (A000290) with nonzero pentagonal numbers (A000326).at n=13A271663
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1006", based on the 5-celled von Neumann neighborhood.at n=43A273861
• a(n) = a(n-2) + 2*a(n-3) for n >= 3, where a(0) = 2, a(2) = 4, a(3) = 5.at n=23A288668
• a(n) = n^2 - n^3 + n^4.at n=14A309372