110769

Appears in sequences

• Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.at n=38A067603
• Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=5A206535
• Number of (n+1) X 7 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=0A206540
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=15A206542
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=20A206542