24126

Appears in sequences

• Numbers n such that n^1024 + 1 is prime (a generalized Fermat prime).at n=26A057002
• G.f.: A(x) = 1/(1 - x*(1+x)/(1 - x^2*(1+x)/(1 - x^3*(1+x)/(1 - x^4*(1+x)/(1 - ...))))), a continued fraction.at n=14A193021
• Number of n X 5 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=5A229425
• Number of n X 6 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=4A229426
• T(n,k) = Number of n X k 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=49A229428
• T(n,k) = Number of n X k 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=50A229428
• Number of length n+2 0..5 arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=4A250317
• T(n,k)=Number of length n+2 0..k arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=40A250320
• Number of length 5+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=4A250324
• a(n) = 36*n^2 - 8*n - 2 (n >=1).at n=25A304834