112625

Appears in sequences

• Numbers that are the sum of 2 nonzero squares in exactly 8 ways.at n=30A025291
• Numbers that are the sum of 2 nonzero squares in 7 or more ways.at n=33A025298
• Numbers that are the sum of 2 nonzero squares in 8 or more ways.at n=32A025299
• Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.at n=30A025309
• Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways.at n=33A025317
• Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways.at n=32A025318
• Numbers n that are the hypotenuse of exactly 31 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 31 ways.at n=13A097244
• Table of coefficients in the iterations of Euler's tree function (A000169), as read by antidiagonals.at n=49A274390
• A diagonal of rectangular array A274390 of coefficients in the iterations of Euler's tree function (A000169).at n=4A274392
• Table of coefficients in the iterations of Euler's tree function (A000169), as read by antidiagonals.at n=50A274740