1048566

Appears in sequences

• a(n) = 4^n - n.at n=10A024037
• 2^(n-1) - (prime(n) mod n).at n=20A077686
• a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).at n=20A084174
• Number of bits required to represent binomial(2^n, 2^(n-1)).at n=20A112884
• Monotonic ordering of nonnegative differences 4^i-10^j, for 40>=i>=0, j>=0.at n=38A192171
• T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=39A221728
• Number of 4 X n arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=5A221730
• a(n) = 2^n - 10.at n=20A246168
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 149", based on the 5-celled von Neumann neighborhood.at n=19A286084
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=19A286118
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 283", based on the 5-celled von Neumann neighborhood.at n=19A287492
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 347", based on the 5-celled von Neumann neighborhood.at n=19A287751
• a(n) is the unique k such that A357961(k) = 2^n.at n=20A357993