196448

Appears in sequences

• a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).at n=23A023488
• a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Lucas number).at n=23A023496
• a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=24A023500
• Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to two, and every 2 X 2 determinant nonzero.at n=7A205991
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero.at n=28A205998
• a(n) is the determinant of the 2 X 2 matrix whose entries (when read by rows) are the n-th primes ending in 1, 3, 7, 9 respectively.at n=40A335592
• Number of length-n binary strings that are the concatenation of two nonempty palindromes.at n=24A370410