112225

Appears in sequences

• a(n) = (10*n + 5)^2.at n=33A017330
• a(n) = (11*n + 5)^2.at n=30A017450
• a(n) = (12*n + 11)^2.at n=27A017654
• Squares with digits in nondecreasing order.at n=26A028820
• Squares composed of digits {1,2,5}.at n=7A031151
• Squares resulting from procedure described in A048383.at n=13A048384
• Squares which when reversed are primes (ignore leading zeros).at n=35A068989
• Number of n-node simple graphs having clique number 6.at n=9A077393
• Perfect powers using only prime digits and 1.at n=16A083806
• Triangle read by rows formed from nonzero entries in table of number of graphs on n nodes with clique number k.at n=40A115196
• a(n) = A133473(n+1)^2.at n=2A181719
• Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=7A207754
• Perfect squares which can be written in all the four forms a^2+b^2, a^2+2*b^2, a^2+3*b^2 and a^2+7*b^2, with a > 0 and b > 0.at n=29A216682
• Numbers n such that the binary XOR of the divisors of n (A178910) is a binary palindrome (A006995) and not a power of 2 (A000079).at n=33A226643
• Triangle read by rows: T(n,k) is the number of unlabeled simple graphs on n vertices with independence number k.at n=50A263341
• Triangle read by rows: T(n,k) is the number of graphs with n vertices with vertex cover number k-1.at n=49A287024
• Squares whose largest digit is 5.at n=21A295015
• Squares formed by concatenating k and 2*k+1.at n=4A309828
• Squares of composite numbers k that are abelian orders.at n=23A350345
• Perfect powers whose digits are in nondecreasing order.at n=28A355062