6376021

Properties

Appears in sequences

• Factorize the Fibonacci numbers in order, skipping F(0)-F(2), F(6)=8 and F(12)=144; at each step at least one new prime will occur; append to the sequence the smallest such new prime.at n=46A061488
• a(n+1) - 3*a(n) + a(n-1) = (2/3)(1+w^(n+1)+w^(2n+2)), where w = exp(2 Pi I / 3).at n=17A071618
• Expansion of x*(1+3*x+2*x^2)/((1+x+x^2)*(1-x-x^2)).at n=33A100886
• Expansion of (1-x)*(2*x^2+2*x+1) / ((x^2-x-1)*(x^2+x+1)).at n=33A111734
• a(n) = F(n)/Product_{p=primes} F(p^(m_{n,p})), where p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer and F(k) is the k-th Fibonacci number.at n=50A113196
• a(n) = F(n-th squarefree)/product{p=primes,p|(n-th squarefree)} F(p), where F(m) is m-th Fibonacci number.at n=31A115022
• a(n) = floor(Lucas(n+1)/2), Lucas(n) = A000032(n).at n=33A173714
• a(n) = numerator of Sum_{i=1..n} binomial(2n-i-1,i-1)/i.at n=16A175385
• Prime numbers that are Fibonacci integers.at n=42A178762
• Half the number of n X 2 binary arrays with every element equal to exactly one or two of its horizontal and vertical neighbors.at n=16A185828
• a(n) = numerator of B(0,n) where B(n,n) = 0, B(n-1,n) = 1/n, and B(m,n) = B(m-1,n+1) - B(m-1,n).at n=33A189731
• a(0)=a(1)=1, a(n+2) = a(n+1) + a(n) - A128834(n).at n=34A226956
• The edge independence number of the Lucas cube Lambda(n).at n=34A245968
• Indices of triangular numbers (A000217) that are also centered pentagonal numbers (A005891).at n=11A254626
• Partial sums of the Lucas numbers of the form L(3n+2) (A163063).at n=10A307268
• Prime numbersat n=436898