53133

Appears in sequences

• Fibonacci sequence beginning 0, 3.at n=22A022086
• a(n) = a(n-1)+ceiling(a(n-2)/2) with a(0)=0, a(1)=1.at n=35A064323
• Numbers such that the nonzero product of the digits of its 4th power is also a 4th power.at n=25A066734
• a(n) = 3*Fibonacci(2*n) + 0^n.at n=11A097134
• a(0) = 1; for n>0, a(n) = 3*Fibonacci(n).at n=22A097135
• Expansion of g.f. (3-x)*(1+3*x+x^2)/((1-x-x^2)*(1+x-x^2)).at n=20A099256
• Divide each Fibonacci number by its primitive part.at n=43A105602
• a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=43A111079
• G.f.: x^2*(3+3*x-2*x^2)/ ( (x^2-x-1) * (x^2+x-1)).at n=22A122012
• Row sums of A131325.at n=21A131326
• a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1.at n=34A173497
• Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.at n=5A180790