26367

Appears in sequences

• Numbers k such that phi(x) = 12*k+2 is solvable, where phi is Euler's totient A000010.at n=29A289364
• Number of nX4 0..1 arrays with each 1 adjacent to 3 or 5 king-move neighboring 1s.at n=10A296153
• a(n) is the least number k such that A246600(k) = n, and -1 if no such k exists.at n=13A359081
• Number of free midpoint-free polycubes of size n, identifying rotations and reflections.at n=16A368029
• a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-3*k+1,n-3*k).at n=8A390702