3010350

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=31A001612
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=30A007039
• 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=15A024851
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=31A062724
• a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=30A074392
• a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).at n=7A081015
• a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=31A097132
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=31A098600
• Inverse Moebius transform of Lucas numbers (A000032) 1,3,4,7,11,..at n=30A100107
• a(n) = 1 + (the n-th term in sequence A_n, ignoring the offset), or a(n) = -1 if A_n has fewer than n terms.at n=31A102288
• Ceiling(phi^n) where phi = (1+sqrt(5))/2.at n=31A169986
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=32A181716
• Partial sums of A005248.at n=15A188378
• Partial sums of the squares of Lucas numbers (A000032).at n=15A216243
• Sum of positive divisors of A000032(n).at n=31A272439
• Sum of odd divisors of Lucas(n).at n=30A280108
• Number of maximal independent vertex sets (and minimal vertex covers) in the n-Moebius ladder graph.at n=28A290608
• Number of odd chordless cycles in the (2n+1)-prism graph.at n=14A301774
• Number of odd chordless cycles in the (2n+1)-web graph.at n=14A301775