1860500
domain: N
Appears in sequences
- a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=30A000211
- a(n) = n + n*(n-1)*(n-2)*(n-3)*(n-4).at n=20A001095
- Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=29A007039
- Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=29A007040
- Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=30A048162
- a(n) = Lucas(n) + (-1)^n + 1.at n=29A068397
- a(n) = Lucas(4n+2)+2, or 5*Fibonacci(2n+1)^2.at n=7A081067
- a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.at n=15A092387
- a(n) = 5*Fibonacci(n)^2.at n=14A099921
- Inverse Moebius transform of Lucas numbers (A000032).at n=30A108031
- Let L(n) = Fibonacci(n-1)+Fibonacci(n+1) (cf. A000045, A000032); if n is even then a(n) = (L(n)+2)^2 otherwise a(n) = L(2*n)+2.at n=15A233000
- Duplicate of A092387.at n=15A240926