94116

Appears in sequences

• Triangle read by rows: T(n,k) (n >= 2, k >= 1) is the number of non-crossing connected graphs on n nodes on a circle such that the distance from a fixed node (root) to the next node is k. Rows are indexed 2,3,4,...; columns are indexed 1,2,3, ... .at n=39A143018
• Number of (n+1)X5 0..2 arrays with every 2X2 subblock in a row having an equal number of equal diagonal or equal antidiagonal elements, adjacent rows differing in this number, and new values 0..2 introduced in row major order.at n=2A205622
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock in a row having an equal number of equal diagonal or equal antidiagonal elements, adjacent rows differing in this number, and new values 0..2 introduced in row major order.at n=17A205626
• Number of 4X(n+1) 0..2 arrays with every 2X2 subblock in a row having an equal number of equal diagonal or equal antidiagonal elements, adjacent rows differing in this number, and new values 0..2 introduced in row major order.at n=3A205628
• Numbers k such that both k and k^2 are sums of a twin prime pair.at n=17A213784
• Numbers k such that Sum_{i=1..k} i^A000010(k) == 2 (mod k).at n=6A330068