142055

Appears in sequences

• a(n) = a(n-1) + a(n-2) + F(n) - 1, a(0) = a(1) = 0, where F() = Fibonacci numbers A000045.at n=21A006478
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,1}.at n=51A080002
• Semiprimes k such that k+2 and k+6 are primes and k+4 and k+8 are all semiprimes.at n=35A392186