159840

Appears in sequences

• Numbers n such that sigma(n) is congruent to n mod phi(n).at n=25A066679
• Smallest solution to x+n*phi(x) = sigma(x) = x+n*A000010(x) = A000203(x).at n=9A076374
• Numbers whose set of base 11 digits is {0,A}, where A base 11 = 10 base 10.at n=27A097257
• When this sequence is interleaved with its first differences and the resulting sequence is divided into blocks of 10 digits, each block contains 10 distinct digits. Each term is chosen to be the smallest that satisfies this property.at n=27A101246
• Numbers k such that 2*k+1, 4*k+1, 8*k+1, 16*k+1 and 32*k+1 are primes.at n=19A124413
• Number of reduced 3 X 3 semimagic squares with distinct nonnegative integer entries and maximum entry n.at n=27A173727
• Number of permutations of 1..n with all adjacent differences <= 6 in absolute value.at n=9A177278
• Numbers with prime factorization pqr^3s^5.at n=21A190475
• Number of length n 0..1 arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=19A244781
• Number of permutations p of {1,...,n} such that |p(i+1)-p(i)| < k, k=2,...,n; T(n,k), read by rows.at n=33A249631