2013265920

Appears in sequences

• a(n) is the smallest number such that a(n)+1 is a prime and the largest power of 2 which divides it is 2^n.at n=27A057777
• 1/4 times the number of n X n 0..7 matrices with MM' mod 8 = I, where M' is the transpose of M and I is the n X n identity matrix.at n=4A071900
• a(n) = n*2^(n-4).at n=26A079859
• a(0) = a(1) = 1; for n > 1, a(n) = (n+2)*2^(n-2).at n=28A087447
• Smallest number beginning with 2 and having exactly n prime divisors counted with multiplicity.at n=28A106422
• a(n) = 15*2^n.at n=27A110286
• First differences of A129952.at n=28A129953
• Number of edges in geodesic dome generated from icosahedron by recursively dividing each triangle in 4.at n=14A277451
• Denominators of the exponential expansion of (4/(log(1+x)))*(1 - 1/(1+x)^(1/4)).at n=13A285063
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 81", based on the 5-celled von Neumann neighborhood.at n=30A285654
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 213", based on the 5-celled von Neumann neighborhood.at n=30A286733
• G.f. A(x) satisfies A(x) = ( 1 + 16*x*A(x)*(1 + A(x)) )^(1/4).at n=10A371990