64080

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=23A001612
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=22A007039
• Least m such that if r and s in {-F(2*h) + phi*F(2*h-1): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and phi = (1+sqrt(5))/2 (golden ratio).at n=11A024851
• Numbers whose set of base-13 digits is {2,3}.at n=39A032813
• Denominators of continued fraction convergents to sqrt(401).at n=3A041761
• Expansion of e.g.f. (1-2x)/(1-3x+x^2).at n=6A052574
• A simple context-free grammar in a labeled universe: labeled version of A052705.at n=6A052728
• a(n) = Sum_{d|3} phi(d)*n^(3/d).at n=40A054602
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=23A062724
• a(n) = Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=3.at n=34A068020
• a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=22A074392
• a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).at n=5A081015
• a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=23A097132
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=23A098600
• Inverse Moebius transform of Lucas numbers (A000032) 1,3,4,7,11,..at n=22A100107
• Integer squares y from the smallest solutions of y^2 = x*(a^N - x)*(b^N + x) (elliptic line, Weierstrass equation) with a and b legs in primitive Pythagorean triangles and N = 2. Sequence ordered in increasing values of leg a.at n=36A120210
• a(0)=1; for n >= 1, a(n) = ceiling(Fibonacci(n)/a(n-1)).at n=48A140829
• Expansion of q^(-3/4) * eta(q^2)^2 * eta(q^20) / (eta(q)^2 * eta(q^4)) in powers of q.at n=33A146163
• Ceiling(phi^n) where phi = (1+sqrt(5))/2.at n=23A169986
• a(n) = ceiling(A173510(n)/2).at n=45A173513