32289

Appears in sequences

• a(n) = s(1)*s(2)*...*s(n+1)*(1/s(2) - 1/s(3) + ... + c/s(n+1)), where c = (-1)^(n+1) and s(k) = 4k-3 for k = 1,2,3,...at n=4A024384
• Three-quadrant Ferrers graphs that partition n.at n=17A059776
• Number of n X n binary arrays with all ones connected only in a 1000-1000-1111-0001-0001 pattern in any orientation.at n=9A147392
• Number of partitions of n with difference 2 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=46A242693
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 643", based on the 5-celled von Neumann neighborhood.at n=28A273314
• a(n) = Sum_{p | A055204(n)} 2^(pi(p) - 1).at n=49A336510
• a(n) = Sum_{k>=1} (4*k - 1)^n / 2^k.at n=4A355220