262134

Appears in sequences

• 2^(n-1) - (prime(n) mod n).at n=18A077686
• a(n) = largest multiple of n which is <= 2^n.at n=17A128092
• Numbers k such that 2^k == 10 (mod k).at n=5A128123
• a(n) = the largest positive multiple of n with exactly n digits when written in binary.at n=17A162214
• Expansion of o.g.f. x*(1 - x + x^2)/(1 -3*x +x^2 +3*x^3 -2*x^4).at n=18A173009
• Monotonic ordering of nonnegative differences 4^i-10^j, for 40>=i>=0, j>=0.at n=32A192171
• a(n) = 2^n - 10.at n=18A246168
• Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = (2^a(n)*(6*k - (3 - (-1)^a(n))*(1 - (-1)^n)/2) - 2^n + 4)/6, n,k >= 1, where {a(n)} is the Beatty sequence A117630 defined by a(n) = floor(n*log(3)/log(3/2)).at n=39A254312
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=17A286118
• a(n) = 4^n - n - 1.at n=8A290721
• a(n) = 2^n - floor((n+3)/2).at n=18A320933