26546

Appears in sequences

• a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=43A024980
• Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 12.at n=26A031600
• Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1.at n=40A098485
• a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-5).at n=34A107368
• Number of (n+3)X(3+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=6A262238
• T(n,k) = Number of (n+3) X (k+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=38A262240
• T(n,k) = Number of (n+3) X (k+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=42A262240
• 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=38A323750