43912

Appears in sequences

• First subdiagonal of triangular array T: T(j,1) = 1 for ((j-1) mod 8) < 4, else 0; T(j,k) = T(j-1,k-1) + T(j,k-1) for 2 <= k <= j.at n=16A131075
• Number of -n..n arrays x(0..3) of 4 elements with sum zero and with zeroth through 3rd differences all nonzero.at n=20A200040
• Number of (n+1) X (5+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=5A235890
• Number of (n+1) X (6+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=4A235891
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 57", based on the 5-celled von Neumann neighborhood.at n=40A270077
• Numbers k>0 such that k' = (k-1)' + (k-2)', where k' is the arithmetic derivative of k.at n=4A276701
• a(n) = Sum_{k=0..floor(n/8)} binomial(n,8*k).at n=18A306859
• Cogrowth sequence of the 16-element group C8 X C2 = <S,T | S^8, T^2, [S,T]>.at n=9A377840