317841

Appears in sequences

• a(n) = F(n+3) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or 2 or is not a Fibonacci number.at n=24A022809
• a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2 ) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=24A023502
• Odd numbers n divisible by 3 such that for all k >= 1 the numbers n*2^k + 1 and n*2^(k+1) + 1 do not form a pair of primes.at n=22A243857
• G.f. B(x) satisfies: B(x) = x + A(B(x))^3 such that A(x) = x + B(A(x))^2, where A(x) is the g.f. of A263532.at n=10A263533