32785

Appears in sequences

• Obtainable by applying +, * and exponentiation to its own digits.at n=33A046469
• a(n) = 1 + 2^(n-1) + n for n > 0, a(0) = 2.at n=16A052968
• Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.at n=29A071595
• From P-positions in a certain game.at n=15A081691
• a(n) = n^3 + 17.at n=32A084379
• Integers N such that by inserting + or - or * or / or ^ between each of their digits, without any grouping parentheses, you can get N (the ambiguous a^b^c is avoided).at n=16A156954
• G.f. satisfies: A(x) = Sum_{n>=0} x^(n^2) * A(x)^n.at n=20A157134
• Integers n such that by inserting between their digits + or - or * or / or ^ or nothing (i.e., concatenate two digits) you recover n back in a nontrivial way.at n=21A157198
• Numbers n such that a digit of n to the power k plus the sum of the other digits of n equals n, where k is a positive integer.at n=23A257860
• Numbers with exactly 3 ones in both binary and ternary representations.at n=48A281004
• Positions of 0 in A288381; complement of A288383.at n=17A288382
• Number of nX5 0..1 arrays with every element equal to 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=14A298143
• Fixed points of A324556.at n=11A324557
• Numbers m such that sigma(m) = tau(m)! where sigma(k) = A000203(k) and tau(k) = A000005(k).at n=23A351866