17048641

Appears in sequences

• Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0.at n=27A067331
• a(n) = a(n-1) + a(n-2) + F(n), with a(0) = 0, a(1) = 1, a(2) = a(1) + a(0), a(3) = a(2) + a(1), a(4) = a(3) + a(2) + 2.at n=30A166106
• Prime powers (A025475) such that the distance to the nearest prime power is an oblong number (A002378).at n=23A239521