2621439

Appears in sequences

• a(n) = (n+3)*2^n - 1.at n=18A006589
• a(n) = 5*2^(n-1) - 1, n>0, with a(0)=1.at n=20A052549
• a(n) = T(n,1), array T as in A054134.at n=20A054135
• Number of Bottleneck-Monge matrices with 2 rows. In the formula below, P = 2.at n=15A070050
• Total number of parts in all compositions of n into relatively prime parts.at n=18A085411
• a(n) = Sum_{k=0..n} binomial(n+(-1)^k, k).at n=20A087940
• a(n) = 5*2^n - 1.at n=19A153894
• a(n) = 10*8^n - 1.at n=6A198857
• 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=18A244364
• Record values in A135141.at n=40A246347
• 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=21A287463
• Numbers k such that the odd part of (1+k) divides (1 + odd part of A048250(k)), where A048250 is sum of the squarefree divisors of n.at n=36A387410
• Numbers k such that the odd part of (1+k) divides (1 + odd part of A003959(k)), where A003959 is multiplicative with a(p^e) = (p+1)^e.at n=37A387419