101761

Appears in sequences

• a(n) = (8*n + 7)^2.at n=39A017150
• a(n) = (10*n + 9)^2.at n=31A017378
• a(n) = (11*n)^2.at n=29A017390
• a(n) = (12*n + 7)^2.at n=26A017606
• Palindromic squares in base 16.at n=10A029734
• Smallest square that contains the digits of n in its exact middle.at n=17A062689
• Numbers k having exactly one divisor d such that in binary representation d and k/d have the same number of 1's as k.at n=16A080026
• Squares of the form 3S + 4, where S is a semiprime.at n=31A112630
• a(n) = (29*n)^2.at n=11A133496
• Six-digit squares that are concatenation of two 3-digit primes.at n=0A153050
• Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up, up.at n=5A177558
• a(n) = the smallest n-digit number with exactly 9 divisors, a(n) = 0 if no such number exists.at n=5A182677
• Squares s such that s + 1234567890 is prime.at n=13A241538
• Squares whose largest digit is 7.at n=37A295017
• Squares of composite numbers k that are abelian orders.at n=20A350345
• a(n) is the least k such that phi(k) + d(k) = A357916(n), where phi(k) = A000010(k) is Euler's totient function, and d(k) = A000005(k) is the number of divisors of k.at n=40A357917
• Numbers c such that a + b + c = d are abcd quadruples in the "abcd-conjecture" with a < b < c < d, all |a|, b, c, d are pairwise coprime, the quality q of the quadruple has q > 1, term a = +/- 1 = A376149(n) and term b = A376144(n) (with repetitions and sorted by c then b).at n=21A376143
• Powerful numbers k that are not prime powers such that there exist no numbers m such that rad(m) | k and Omega(m) > Omega(k), where rad = A007947 and Omega = A001222.at n=29A377591