59264

Appears in sequences

• Numbers not ending in 0 which are the product of two substrings of themselves. The substrings may be equal, but each must be greater than 1.at n=11A066217
• a(0) = 1; for n>0, a(n) = number of distinct sums of subsets of {1, 1/2, 1/3, 1/4, ..., 1/n} (allowing the empty subset).at n=18A072207
• a(n) = n * [1 + sum(k=1 to n) prime(k)].at n=32A083725
• Numbers k such that k concatenated with k-4 gives the product of two numbers which differ by 7.at n=1A116132
• Numbers k such that k concatenated with k+2 gives the product of two numbers which differ by 5.at n=2A116172
• a(n) = a(n - 1) + (n - 1)*a(n - 2).at n=11A122031
• Number of 5 X n 0..1 arrays avoiding 0 0 1 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=7A207256
• Let x(0)x(1)... x(q-1)x(q) denote the decimal expansion of a number n. The sequence lists the numbers such that n and the number represented by its middle digits x(1)x(2)...x(q-1) have the same distinct prime divisors.at n=27A243812
• Multiples of 1852.at n=32A303272
• a(n) is the least nonnegative integer k such that n OR k is a cube (where OR denotes the bitwise OR operator).at n=55A330272
• a(n) = Sum_{k=0..floor(n/3)} 2^k * binomial(2*k,2*n-6*k).at n=21A387763