45558

Appears in sequences

• a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, for n>4: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5)], where SORT places digits in ascending order and deletes 0's.at n=44A108566
• Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7.at n=23A252249
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 189", based on the 5-celled von Neumann neighborhood.at n=40A270679
• Number of nX4 0..1 arrays with every element equal to 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=11A298255