161857

Appears in sequences

• Let u be any string of n digits from {0,1,2}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-3 number; then a(n) = max_u f(u).at n=15A065844
• Maximum number of odd 2 X 2 submatrices over all 2n X 2n (0,1) matrices.at n=16A093699
• For the Collatz (3x+1) iteration starting at k, the sequence lists the smallest k such that Fibonacci(n) belongs to the trajectory of k, or 0 if no such k exists.at n=25A260389
• Lower (2/3)-midsequence of A000032 (Lucas numbers) and A000045 (Fibonacci numbers); see Comments.at n=25A389121