779689

Appears in sequences

• Squares containing 2k digits in which the sum of the first k digits = that of the rest.at n=29A068897
• Squares of the form prime(k)*prime(k+1) + 2*prime(k+1).at n=34A108604
• a(n) = {n^2}_{n^2}.at n=20A122626
• Number of n X 2 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=4A206791
• Number of nX5 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=1A206794
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=16A206797
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=19A206797
• Number of nX5 0..3 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=1A206964
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=16A206967
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=19A206967
• Number of nX5 0..3 arrays avoiding the pattern z z+1 z in any row or column.at n=1A207131
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row or column.at n=16A207134
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row or column.at n=19A207134
• Number of nX5 0..3 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.at n=1A209089
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.at n=16A209092
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.at n=19A209092
• The squares related to the strictly increasing subsequence of A053667(n), n >= 1.at n=26A248648
• Prime powers p^k such that p^k = x^3 + y^3 + z^3 where x, y, z are positive integers and k > 1, is soluble.at n=33A271829