376832

Appears in sequences

• First differences of A045891.at n=18A034007
• a(n) = 2^(n-3)*(n + 3)*(2*n - 3).at n=10A059224
• a(n) = (3*n-2)*2^(n-3).at n=14A066373
• 15-almost primes (generalization of semiprimes).at n=23A069276
• a(n) = 0^n/2 + 2^n*(n^2+n+2)/4.at n=13A087431
• Second differences of A045623, prefixed by an initial 1.at n=17A109975
• Expansion of x*(5+x+x^2)/(1-2*x).at n=17A248646
• Number of (5+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=11A252537
• Decimal representation of the n-th iteration of the "Rule 67" elementary cellular automaton starting with a single ON (black) cell.at n=12A266839
• Numbers of the form 4^k*(8*j+7) that have exactly three partitions into four positive squares.at n=23A274642
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood.at n=18A281046
• Smallest number k that cannot be expressed as x^2 + y^2 + z^2 + w^2 where x >= y >= z >= w >= 0 and x > floor(sqrt(k)) - n, but can be so expressed if x = floor(sqrt(k)) - n.at n=36A285552
• Array read by ascending antidiagonals: A(n,k) = 4^n*(8*k + 7).at n=47A383414