364179
domain: N
Appears in sequences
- Fibonacci sequence beginning 0, 3.at n=26A022086
- a(n) = 3*Fibonacci(2*n) + 0^n.at n=13A097134
- a(0) = 1; for n>0, a(n) = 3*Fibonacci(n).at n=26A097135
- Expansion of g.f. (3-x)*(1+3*x+x^2)/((1-x-x^2)*(1+x-x^2)).at n=24A099256
- Divide each Fibonacci number by its primitive part.at n=51A105602
- a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=51A111079
- G.f.: x^2*(3+3*x-2*x^2)/ ( (x^2-x-1) * (x^2+x-1)).at n=26A122012
- Row sums of A131325.at n=25A131326