229375

Appears in sequences

• Woodall (or Riesel) numbers: n*2^n - 1.at n=13A003261
• a(n) = 2*a(n-2) + 1.at n=31A010737
• Number of Bottleneck-Monge matrices with 2 rows. In the formula below, P = 2.at n=12A070050
• Indices of triangular numbers listed in A075088.at n=20A076550
• a(n) = 7*2^n - 1.at n=15A086224
• Numbers of the form i*8^j-1 (i=1..7, j >= 0).at n=41A165804
• a(n) = 7*8^n - 1.at n=5A198855
• a(n) = 14 * 4^n - 1.at n=7A206372
• Numbers in A206853 without proper divisors > 1 from the same sequence.at n=43A209630
• Positions of records in A249695.at n=19A249715
• If n is the i-th positive integer with binary weight j, then a(n) is the j-th positive integer with binary weight i.at n=48A263018
• Decimal representation of the middle column of the "Rule 175" elementary cellular automaton starting with a single ON (black) cell.at n=17A267604
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 453", based on the 5-celled von Neumann neighborhood.at n=23A282303
• 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 483", based on the 5-celled von Neumann neighborhood.at n=17A288591
• 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 569", based on the 5-celled von Neumann neighborhood.at n=17A289409
• a(n) = 7*2^n + (-1)^n.at n=15A321483
• a(n) - 2*a(n-1) = period 2: repeat [3, 0] for n > 0, a(0)=5, a(1)=13.at n=15A322417
• 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=27A387410