327679

Appears in sequences

• a(n) = 2*a(n-2) + 1.at n=32A010737
• a(n) = 5*2^(n-1) - 1, n>0, with a(0)=1.at n=17A052549
• Comparisons needed for Batcher's sorting algorithm applied to 2^n items.at n=13A053545
• a(n) = T(n,1), array T as in A054134.at n=17A054135
• Arithmetic mean of successive Mersenne primes.at n=5A098041
• a(n) = 5*2^n - 1.at n=16A153894
• a(n) = 5*4^n - 1.at n=8A156760
• Semi-sums (average) of two (not necessarily distinct) Mersenne primes (A000668).at n=26A169628
• Semi-sums (average) of any two distinct Mersenne primes (A000668).at n=20A171253
• a(n) = 10*8^n - 1.at n=5A198857
• Number of (n+2)X5 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=6A202373
• Number of (n+2)X9 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=2A202377
• a(n) is the least integer m > 1 such that n is the largest number of identical digits that can end m^k for positive integer k.at n=15A244364
• Record values in A135141.at n=34A246347
• 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 809", based on the 5-celled von Neumann neighborhood.at n=19A286858
• a(n) = 5*2^n - (-1)^n.at n=16A321643
• Maximal size of a Binary Decision Diagram (or BDD) of index n.at n=21A327461