63609

Appears in sequences

• a(n) = A026120(2n,n+1).at n=6A026132
• a(0)=1 and a(n) for n > 0 equals the minimal positive integer such that addition of 2^(-a(n)) to Sum_{k = 0,1,...,n-1} 2^(-a(k)) changes only trailing zeros in its decimal representation.at n=9A137284
• a(n) = A156071(n)/n.at n=5A156069
• Smallest positive integer b such that b^(2^n)+1 is divisible by the square of A035089(n+1).at n=10A261117
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 587", based on the 5-celled von Neumann neighborhood.at n=40A273079
• Numbers k such that sopfr(k) = tau(k)^2.at n=35A305026
• Total number of blocks in all set partitions of [n] such that each element is contained in a block whose index parity coincides with the parity of the element.at n=12A364267