39564

Appears in sequences

• Numbers k that divide the sum of the digits of (2k)^k.at n=30A108860
• Number of n X 3 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 3 neighbors with the same value.at n=5A164760
• n^3+Smallest square, (Smallest square >= n^3).at n=27A176581
• Numbers n such that n*2^2281 - 1 is prime.at n=40A265504
• a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.at n=36A274328
• Number of different possible profiles of palindromic length for prefixes of binary sequences of length n.at n=17A340311
• a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly n ways, or 0 if no such number exists.at n=15A350270
• E.g.f. satisfies A(x) = (1 - x * A(x))^(log(1 - x * A(x)) / 2).at n=7A357036