204672

Appears in sequences

• a(0)=1. a(n) = sum of the earlier terms which are divisible by (the number of 1's in the binary representation of n).at n=28A123757
• G.f. A(x) satisfies: A(x) = A( x^3 + 6*x*A(x)^3 )^(1/3), with A(0)=0, A'(0)=1.at n=8A271934
• Table read by rows. T(n, k) = [x^k] n! * Sum_{j=0..n} binomial(n*x, j).at n=37A358366
• A variant of payphone permutations: given a row of n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible, and a payphone adjacent to a single occupied payphone is preferred over a payphone sandwiched between two occupied payphones.at n=12A363785