68260

Appears in sequences

• a(n) = a(n-1) + a(n-2) with a(0)=2, a(1)=5. Sometimes called the Evangelist Sequence.at n=21A001060
• a(n) = F(n+1) + L(n), where F(n) and L(n) are Fibonacci and Lucas numbers, respectively.at n=22A013655
• a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,2,4.at n=18A049870
• a(1)=2, a(2)=3, then a(n)=a(n-1)+a(n-2) if n odd, a(n)=a(n-1)-a(n-2) if n even.at n=42A174562
• a(1)=2, a(2)=3, then a(n)=a(n-1)+a(n-2) if n odd, a(n)=a(n-1)-a(n-2) if n even.at n=45A174562
• s(k)-s(j), where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number.at n=24A205879
• Values of x in the solutions to x^2 - 3xy + y^2 + 11 = 0, where 0 < x < y.at n=22A237132
• 2nd-largest term in n-th row of Stern's diatomic triangle A002487.at n=22A244472
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A296272
• Numbers k(n) used for Markoff forms determining quadratic irrationals with purely periodic continued fractions.at n=23A305311
• a(n) is the smallest number k such that k^2+1 divided by its largest prime factor is equal to F(2*n-1) for n > 0, or 0 if no such k exists, where F(n) is the Fibonacci sequence.at n=11A339315