137641

Appears in sequences

• a(n) = (11*n + 8)^2.at n=33A017486
• a(n) = (12*n + 11)^2.at n=30A017654
• Smallest square containing n-th prime as substring.at n=32A029945
• Smallest extension of n-th prime which is a square.at n=32A030671
• Squares containing 2k digits in which the sum of the first k digits = that of the rest.at n=4A068897
• Odd squares not in A113659.at n=11A103962
• Six-digit squares that are concatenation of two 3-digit primes.at n=4A153050
• Squares that become prime numbers when prefixed with a 6.at n=36A167721
• Squares that becomes a prime number when prefixed with a 9.at n=22A167724
• Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically.at n=4A208037
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically.at n=49A208039
• Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically.at n=5A208041
• Number of triangular n X n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any neighbor, and containing the value n(n+1)/2-2.at n=31A211899
• Squares whose largest digit is 7.at n=40A295017
• Expansion of 1/(1 - x*Product_{k>=1} (1 + x^(2*k-1))).at n=20A302017
• Array read by antidiagonals: T(m,n) = number of total dominating sets in the grid graph P_m X P_n.at n=31A303111
• Array read by antidiagonals: T(m,n) = number of total dominating sets in the grid graph P_m X P_n.at n=32A303111
• Array read by antidiagonals: T(m,n) = number of minimal total dominating sets in the grid graph P_m X P_n.at n=60A303118
• Number of minimal total dominating sets in the n X n grid graph.at n=5A303161
• Matula-Goebel numbers of series-reduced powerful uniform rooted trees.at n=38A318692