26982

Appears in sequences

• Numbers whose base-4 representation contains exactly four 1's and four 2's.at n=26A045109
• a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=8A145537
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=11A186488
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=13A186488
• T(n,m)=Number of (n+1)X5 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=22A189174
• T(n,m)=Number of (n+1)X3 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=39A190023
• a(n) = n XOR n^3.at n=30A261807
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 339", based on the 5-celled von Neumann neighborhood.at n=33A271291
• a(n) = 27*n^2 - 21*n + 6 (n>=1).at n=31A304164
• Unique solution x of the congruence x^2 = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3.at n=30A324601