65279

Appears in sequences

• a(n) = 4^n - 2^n - 1.at n=8A156589
• Numbers which contain only the digit 3 in their base-4 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1 or 2, otherwise the exception must be the digit 2.at n=46A188529
• Numbers in A206853 without proper divisors > 1 from the same sequence.at n=37A209630
• Semiprimes of the form (2^k - m)*(m*2^k - 1).at n=24A239038
• Decimal representation of the n-th iteration of the "Rule 153" elementary cellular automaton starting with a single ON (black) cell.at n=8A262866
• 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 515", based on the 5-celled von Neumann neighborhood.at n=15A288828
• a(n) = Sum_{d|n} (-1)^(n/d+1)*d^8.at n=3A321553
• Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+1)*d^k.at n=69A322081
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) is the number of ordered k-tuples (x_1, x_2, ..., x_k) with gcd(x_1, x_2, ..., x_k) = 1 (1 <= {x_1, x_2, ..., x_k} <= n).at n=58A344527
• a(n) = Sum_{k = ceiling(n/2)..n-1} A354169(k).at n=23A354757
• a(n) is the bitwise OR of (the binary expansions of) b(n+1) to b(2*n), where b is A354169.at n=10A354780
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = Sum_{1 <= x_1, x_2, ..., x_k <= n} n/gcd(x_1, x_2, ..., x_k, n).at n=48A372968
• Number of integer compositions of n whose leaders of strictly increasing runs are strictly decreasing.at n=32A374689