149041

Appears in sequences

• a(n) = min( x : x^4 + n^4 = 0 mod (x+n-1) ).at n=16A066487
• Half the number of n X n binary matrices, symmetric under 90-degree rotation, having equal row sums.at n=10A140884
• Number of binary strings of length n with no substrings equal to 0000, 0011, or 1001.at n=22A164428
• Non-palindromic composite numbers such that n' = [Rev(n)]', where n' is the arithmetic derivative of n.at n=21A259077
• Let b(n) = 2^n with n >= 2, and let c = k*b(n) + 1 for k >= 1; then a(n) is the smallest k such that c is prime and such that A007814(r(n)) = A007814(k) + n where r(n) is the remainder of 2^(b(n)/4) mod c, or 0 if no such k exists.at n=30A298669
• a(n) is the minimum positive integer m such that m * 2^(n + 2) + 1 is a prime number which does not divide ((F(n + 2) - 1)^m - 1)/(F(n + 2) - 2), where F(n) is the n-th Fermat number (A000215).at n=30A308695