246016

Appears in sequences

• Sum of first n cubes; or n-th triangular number squared.at n=31A000537
• Squares of even triangular numbers.at n=14A014738
• Squares of even hexagonal numbers.at n=7A014772
• Row sums of triangle A110205, where A110205(n,k) equals the sum of cubes of numbers < 2^n having exactly k ones in their binary expansion.at n=4A110206
• Triangle T, read by rows, equal to the matrix square of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).at n=18A113108
• Squares of perfect numbers.at n=2A133051
• Perfect squares that are a product of two triangular numbers.at n=37A169835
• Numbers of the form p^8*q^2 where p and q are distinct primes.at n=11A179699
• Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=29A207363
• Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=28A250813
• Number of (n+2)X(4+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=4A257357
• Number of (n+2)X(5+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=3A257358
• T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with no 3 X 3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=31A257361
• T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with no 3 X 3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=32A257361
• Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have (a+b)^2 = k.at n=23A258844
• Perfect powers k such that A052409(k) is equal to A052409(A366275(k)).at n=20A366278
• "Late birds" in A390939: terms A390939(m) such that A390939(k) > A390939(m) for all k > m, where A390939 lists the keys added in the map initialized with T[1] = 1 and then repeatedly T[v] := k + (T[v] if defined else 0) for all key-value pairs (k, v) in T.at n=24A390941