34111385

Appears in sequences

• a(n) = 7*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.at n=10A004187
• a(n) = floor(Fibonacci(n)/3).at n=40A004696
• Denominators of continued fraction convergents to sqrt(45).at n=19A041077
• a(n) = Fibonacci(8n)/3.at n=5A049686
• A Fibonacci convolution.at n=19A099483
• A Fibonacci convolution.at n=19A099484
• Largest proper divisor of the Fibonacci numbers > 1.at n=37A139045
• a(n) = Product_{k=1..(n-1)/2} (5 + 4*cos(k*Pi/n)^2).at n=20A152119
• Numerator of x(n) = x(n-1) + x(n-2), x(0)=0, x(1)=1/3; denominator=A167817.at n=40A167816
• a(n) = ceiling(Fibonacci(n)/3).at n=40A293543
• a(n) = round(Fibonacci(n)/3).at n=40A293544
• Multiplicative inverse of Fibonacci(prime(n)) modulo Fibonacci(prime(n+1)).at n=11A309578
• Rectangular array R read by descending antidiagonals: divide the multiples of 3 in the Wythoff array (A035513) by 3, and delete all others.at n=45A328697
• T(n,k) are the values of a variant of the Chebyshev polynomials P(n,x) of order n evaluated at x = k, where T(n,k), n >= 0, k <= n is a triangle read by rows. P(0,x) = 1, P(1,x) = x, P(n,x) = x*P(n-1,x) - P(n-2,x).at n=52A357892
• Lower (1/3)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=19A387782
• Upper (1/3)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=19A387783