20345

Appears in sequences

• Number of partitions of n into its divisors that are powers of primes (A000961) with at least one part of size 1.at n=71A014650
• Integers k such that in the list of divisors of k (in base 6), each digit 0-5 appears equally often.at n=0A045815
• Records in A086068.at n=15A086069
• a(n) is the smallest number greater than a(n-1) such that in a(0) through a(n) no digit occurs more than once more than any other digit.at n=33A095204
• Terms of A122782 which are not Carmichael numbers A002997.at n=38A153515
• Let b(n) be the n-th positive integer that is a palindrome in base 2. a(n) = the smallest multiple of b(n) that is > b(n) and that is also a palindrome in binary.at n=33A162843
• Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A104455.at n=40A171589
• Potential magic constants of 9 X 9 magic squares composed of consecutive primes.at n=34A191679
• Numbers which do not reach zero under either of the iterations: x -> floor(sqrt(x)) * (x - floor(sqrt(x))^2) or y -> ceiling(sqrt(y)) * (ceiling(sqrt(y))^2 - y).at n=24A219963
• a(n) is the smallest number greater than a(n-1) such that in a(1) through a(n) no digit occurs more than once more than any other digit, starting with a(1) = 1.at n=33A248651
• Numbers k such that (206*10^k - 17)/9 is prime.at n=19A284427
• Numbers that are both binary palindromes and binary Smith numbers.at n=36A334530
• Number of unlabeled loopless multigraphs with n edges rooted at two noninterchangeable vertices.at n=7A339065
• Numbers k such that A339549(k) = A339549(k+1).at n=19A339550
• Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges.at n=46A339560