94863

Appears in sequences

• a(n) is the smallest m for which sqrt(sum of digits of m^2) = n.at n=9A061912
• Smallest number whose square has sum of digits A056991(n).at n=35A067179
• Square roots of A068809.at n=27A068947
• Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.at n=24A079095
• Numbers whose squares have a digit average greater than 8.at n=1A164841
• a(n) = (8*n+3)*(8*n+5).at n=38A177065
• Variation on Fermat's Diophantine m-tuple: 1 + the GCD of any two distinct terms is a square.at n=32A274697
• Numbers k such that 6 is the smallest decimal digit of k^2.at n=23A291631
• Numbers k such that the two perfect powers immediately adjacent to k^2 both have exponents greater than 2.at n=36A340643
• a(n) is the largest n-digit number whose square has a digital sum equal to A348300(n).at n=4A348303
• Numbers whose squares have a digit average of 8 or more.at n=2A360803
• Numbers whose squares have at most 2 digits less than 8.at n=61A360822
• Numbers > 9 with increasingly large digit average of their square, in base 10.at n=8A362264
• a(n) is the least integer k such that the sum of the digits of k^2 is 9*n.at n=9A369953
• a(n) is the least integer m such that the sum of the digits of m^2 is 9*(k+n) where k is the number of digits of m.at n=4A369955
• a(n) is the least n-digit number whose square has the maximum sum of digits (A348300(n)).at n=4A370522
• Largest number k for which k^2 is n digits long and has the maximum sum of digits possible for such a square (A371728(n)).at n=9A379298