228826127

Appears in sequences

• a(n) = 11*a(n-1) + a(n-2).at n=8A001946
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=20A005248
• Odd Lucas numbers.at n=26A014447
• Numerators of continued fraction convergents to sqrt(45).at n=19A041076
• Numerators of continued fraction convergents to sqrt(125).at n=13A041226
• Numerators of continued fraction convergents to sqrt(245).at n=15A041458
• Numerators of continued fraction convergents to sqrt(605).at n=15A042160
• a(n) = 4*a(n-1) + a(n-2); a(0)=1, a(1)=7.at n=13A048876
• a(n) = Lucas(4*n).at n=10A056854
• Squarefree Lucas numbers.at n=29A063509
• a(n) = Lucas(10*n).at n=4A065705
• Sum of Lucas numbers and inverted Lucas numbers: a(n) = A000032(n)*A075193(n).at n=38A075270
• Lucas numbers L(8*n).at n=5A087265
• a(n) = (F(2*n-1) + F(2*n+1))*(5/6 - cos(2*Pi*n/3)/3), where F(n) = Fibonacci(n).at n=20A128052
• Odd numbers in A138123.at n=38A142248
• Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent.at n=38A163695
• Nonprime Lucas numbers.at n=27A172159
• Logarithmic derivative of the squares of the Fibonacci numbers (A007598, with offset).at n=19A173661
• a(0) = 2, a(n) = Lucas(phi(n^2)) for n > 0.at n=10A197190
• a(0) = 2, a(n) = Lucas(phi(n)) for n > 0.at n=41A197219