32608

Appears in sequences

• Number of cyclic multigraphs on n labeled edges (without loops).at n=6A020562
• Number of strings of numbers x(i=1..n) in 0..8 with sum i^2*x(i)^2 equal to n^2*64.at n=8A184239
• Number of (n+1)X(3+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=3A236050
• Number of (n+1)X(4+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=2A236051
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=17A236055
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=18A236055
• Sum of column entries of the table with rows of prime numbers (2,3,0,0,...), (0,5,7,11,0,...), (0,0,13,17,19,23,0,...), (0,0,0,29,31,37,41,43,0,...), ...at n=30A238760
• Number of length n arrays x(i), i=1..n with x(i) in i..i+7 and no value appearing more than 3 times.at n=4A250360
• Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 3 times.at n=6A250363
• Number of (4+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=15A252388
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 115", based on the 5-celled von Neumann neighborhood.at n=36A270183