26148

Appears in sequences

• Maximal length of rook tour on an n X n board.at n=33A006071
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=42A025104
• Number of bracelet structures using exactly four different colored beads.at n=11A056359
• Integer part of log(n!)^(1 + log(log(1 + n))).at n=33A062475
• Divide primes in groups with 2n elements and add together.at n=13A109726
• G.f.: -2*(-2 - 11*x - 4*x^2 + x^3)/(x - 1)^4.at n=16A152110
• Maximal length of rook tour on an n X n+2 board.at n=32A152133
• Triangle read by rows: T(n,k) is the number of k-block partitions of an n-set up to rotations and reflections.at n=69A152176
• Numbers k such that phi(k-6) = phi(k) = phi(k+6).at n=28A217006
• Number of partitions of n where the difference between consecutive parts is at most 9.at n=39A238869
• Number of (n+2)X(n+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010001 or 00010101.at n=4A260601
• Number of (n+2) X (5+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000101 00010001 or 00010101.at n=4A260606
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010001 or 00010101.at n=40A260609
• Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2, read by rows, where T(n,k) is the number of 2*(k+2)-cycles in the n X n grid graph which pass through NW corner (0,0).at n=47A333651