163839

Appears in sequences

• a(n) = 2*a(n-2) + 1.at n=30A010737
• a(n) = 5*2^(n-1) - 1, n>0, with a(0)=1.at n=16A052549
• a(n) = T(n,1), array T as in A054134.at n=16A054135
• a(n) = n*8^n - 1.at n=4A064754
• a(n) = Sum_{k=0..n} binomial(n+(-1)^k, k).at n=16A087940
• a(n) = 5*2^n - 1.at n=15A153894
• Numbers of the form i*8^j-1 (i=1..7, j >= 0).at n=39A165804
• a(n) = 5*8^n - 1.at n=5A198853
• 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=14A244364
• Record values in A135141.at n=32A246347
• 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 267", based on the 5-celled von Neumann neighborhood.at n=17A287463
• 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 395", based on the 5-celled von Neumann neighborhood.at n=21A287986
• a(n) is the smallest m such that A347191(m) = 2*n, where A347191(m) = tau(m^2 - 1).at n=33A347193
• Indices of terms in A353730 that are powers of 2.at n=12A353734
• Array read by ascending antidiagonals: A(n,k) = (2*n + 1)*2^(2*k+1) - 1 with k >= 0.at n=52A391685