24475

Appears in sequences

• a(n) = -a(n-1) - 2*a(n-2).at n=30A001607
• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=20A001610
• Partial sums of squares of Lucas numbers.at n=9A005970
• a(n) is the unique odd positive solution x of 2^n = 7x^2+y^2.at n=29A077020
• a(n) = Lucas(4n+1) - 1, or 5*Fibonacci(2n)*Fibonacci(2n+1).at n=5A081017
• a(n) = Lucas(n) + (-1)^n.at n=21A099925
• Triangle, read by rows, of the coefficients of [x^k] in G100231(x)^n such that the row sums are 5^n-1 for n>0, where G100231(x) is the g.f. of A100231.at n=35A100232
• a(n) = Lucas(3*n) - 1.at n=7A100233
• Numbers that are the sum of exactly two sets of Fibonacci numbers.at n=36A122194
• Antidiagonal sums of a triangle of coefficients of recurrences of the Fibonacci sequence.at n=40A138123
• Odd numbers in A138123.at n=19A142248
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*Lucas(n)) ), where Lucas(n) = A000032(n) = ((1+sqrt(5))/2)^n + ((1-sqrt(5))/2)^n.at n=29A174505
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*A014448(n)) ), where A014448(n) = (2+sqrt(5))^n + (2-sqrt(5))^n.at n=10A174506
• Numbers that have 10 terms in their Zeckendorf representation.at n=20A179250
• a(n) = numerator of B(0,n) where B(n,n) = 0, B(n-1,n) = 1/n, and B(m,n) = B(m-1,n+1) - B(m-1,n).at n=20A189731
• The number of compositions of n with no more than 3 consecutive identical parts (summands).at n=16A232394
• Number of partitions p of n not containing floor((min(p) + max(p))/2) as a part.at n=39A238483
• List of numbers L - 1 and L, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed.at n=39A259625
• Number of partitions p of n that contain a proper partition of the maximal part of p.at n=38A279036
• Expansion of x*(1 + 2*x)/((1 - x)*(1 + x)*(1 - x - x^2)).at n=20A301653