167762

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=25A001612
• Number of restricted circular combinations.at n=23A006499
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=24A007039
• 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=12A024851
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=25A062724
• a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=24A074392
• Product of Lucas numbers and inverted Lucas numbers: a(n)=A000032(n)*A075193(n).at n=12A075269
• a(n) = Lucas(4*n+1) + 1, or Lucas(2*n)*Lucas(2*n+1).at n=6A081014
• a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=25A097132
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=25A098600
• Ceiling(phi^n) where phi = (1+sqrt(5))/2.at n=25A169986
• Number of partitions of 2*n-1 into parts not greater than n.at n=24A171985
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=26A181716
• Partial sums of A005248.at n=12A188378
• a(n) = L(n)*L(n+1), where L = A000032 (Lucas numbers).at n=12A215602
• List of numbers L and L + 1, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed.at n=48A259626
• Number of maximal independent vertex sets (and minimal vertex covers) in the n-Moebius ladder graph.at n=22A290608
• Number of odd chordless cycles in the (2n+1)-prism graph.at n=11A301774
• Number of odd chordless cycles in the (2n+1)-web graph.at n=11A301775