4295098369

Appears in sequences

• Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=33A007755
• a(n) = (2^n + 1)^2.at n=16A028400
• Palindromic squares in base 16.at n=25A029734
• Squares which are palindromes in base 4.at n=25A029987
• Smallest square which is one more than the product of n (not necessarily distinct) numbers > 1.at n=20A081949
• Maximum number of rational points on a smooth absolutely irreducible projective curve of genus 1 over the field F_2^n.at n=31A169872
• a(n) = 1+4^(n+1)-4*(-2)^n.at n=15A171590
• 1/4 the number of (n+1) X 2 binary arrays with all 2 X 2 subblock sums the same.at n=32A183978
• Smallest k such that phi(phi(k)) = 2^n, where phi is the Euler totient function.at n=30A184968
• Gaussian norm of 1+(1+i)^n.at n=32A238187
• a(1) = 1; for n>1, a(n) is a prime power p^h (h>=1) with the property that its k-th smallest divisor, for all 1 <= k <= tau(p^h), contains exactly k "1" digits in its binary representation.at n=9A253204
• Composite terms of A007755.at n=11A309672
• The squares of the Fermat primes, (A019434(n))^2.at n=4A330828
• Semiprimes whose both factors are Fermat primes.at n=14A333788
• a(n) is the least perfect power > 2^n.at n=32A357751