24477

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=21A001612
• a(n) = n^3 + 3*n + 1.at n=29A005491
• Number of restricted circular combinations.at n=19A006499
• 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=10A024851
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=21A062724
• a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=20A074392
• Product of Lucas numbers and inverted Lucas numbers: a(n)=A000032(n)*A075193(n).at n=10A075269
• a(n) = Lucas(4*n+1) + 1, or Lucas(2*n)*Lucas(2*n+1).at n=5A081014
• a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=21A097132
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=21A098600
• a(0)=1; for n >= 1, a(n) = ceiling(Fibonacci(n)/a(n-1)).at n=44A140829
• Ceiling(phi^n) where phi = (1+sqrt(5))/2.at n=21A169986
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=22A181716
• Partial sums of A005248.at n=10A188378
• Ceiling((n+1/n)^3).at n=28A197773
• a(n) = L(n)*L(n+1), where L = A000032 (Lucas numbers).at n=10A215602
• a(n) = Sum_{i=0..n} digsum_7(i)^4, where digsum_7(i) = A053828(i).at n=26A231679
• List of numbers L and L + 1, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed.at n=40A259626
• Number of twice-partitions of n into partitions with all different lengths.at n=18A358830
• Number of partitions of n with parts colored by {0, 1} such that the sum of colors is congruent to 1 (mod 2).at n=22A392002