33725

Appears in sequences

• Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=27A064111
• Numbers k such that phi(sigma(phi(k))) = sigma(k).at n=9A066462
• Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=5A209822
• Number of (n+1)X7 0..2 arrays with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=0A209827
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=15A209829
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=20A209829
• Sum of the prime parts in the partitions of n into 6 parts.at n=41A309467
• Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=24A323750