223995

Appears in sequences

• Smallest number x such that phi(x) = phi(x(n)), where x(n) is the n-th arithmetic derivatives of x and x is not equal to x(n).at n=16A246775
• Number of n X 4 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=5A297310
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=41A297314
• Number of 6Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=3A297319
• Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 3 (mod p-1), where s_p(m) is the sum of the base p digits of m.at n=24A324405