65542

Appears in sequences

• Numbers that are the sum of 7 nonzero 8th powers.at n=36A003385
• Numbers k such that phi(k) | sigma_14(k).at n=27A015773
• Least integer m whose largest prime factor > m^(n/(n+1)).at n=14A063765
• a(n) = n_{2^n}.at n=15A122624
• a(n) = 2^n + 6.at n=16A153972
• Numbers that can be formed using its own digits in order and only addition and fourth power operators.at n=36A195672
• 1/4 the number of (n+1) X 6 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=30A209724
• Positions in A212200 where successive new numbers (see A212203) appear.at n=18A212204
• Numbers n such that m + (sum of digits in base-4 representation of m) = n has exactly three solutions.at n=12A230635
• Numbers whose derivative is equal to the arithmetic derivative.at n=35A273993
• a(n) is the smallest number k such that 2k - sigma(k) = 2^n.at n=14A292557
• a(n) is the smallest n-bit number having the most common prime signature among n-bit numbers. (In case more than one prime signature is tied for most common, choose the smallest n-bit number whose prime signature is one of those tied.)at n=16A342172
• a(n) is the next Ulam number (A002858) after 2^(n-1).at n=17A347212
• Replace 2^k in binary expansion of n with 2^(2^k).at n=19A358126
• If n = Sum 2^e(k), then a(n) = Sum 2^a(e(k)), with a(0) = 1.at n=19A381957
• Irregular triangle T(n,k) = 2^(floor(n/3)-k) * nextprime(2^(n-2*(floor(n/3)-k))), with k = 0..floor(n/3)-1.at n=44A384875
• Irregular triangle, read by rows, where row n lists composite numbers c such that c * sigma_n(c) == 2 (mod phi(c)) for n >= 0. Row lengths for n=0,1,... are given in A392307.at n=49A392306