49986

Appears in sequences

• a(n) = smallest k such that the digit sum of 8k is n.at n=45A077495
• a(n) = (2*n^3 + 5*n^2 + 5*n)/2.at n=35A162267
• Number of 1..15 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=3A171289
• Number of 1..n integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3.at n=14A171341
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 453", based on the 5-celled von Neumann neighborhood.at n=42A272275
• Number of nX5 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A281762
• T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=50A281765
• Number of 6Xn 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=4A281770
• p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - S)^3.at n=17A291726