29134601

Properties

Appears in sequences

• a(n) = (F(8*n+7)+F(8*n+5))/3, where F=A000045 (the Fibonacci sequence).at n=4A049679
• a(n) = L(4*n+2)/3, where L=A000032 (the Lucas sequence).at n=9A049685
• Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2).at n=38A058036
• Primitive part of Lucas(n).at n=37A061447
• Primes of the form Lucas(2*n)/3.at n=3A074281
• Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists.at n=38A079451
• Order in which prime factors first occur in the Lucas sequence.at n=42A096362
• Triangle T(n, k) = (k*ChebyshevU(n, (k+2)/2) + 2*ChebyshevT(n+1, (k+2)/2))/2.at n=32A121872
• Expansion of (x-x^3)/(1-3*x+2*x^2-3*x^3+x^4).at n=19A140824
• a(n) = Product_{k=1..(n-1)/2} (5 + 4*cos(k*Pi/n)^2).at n=19A152119
• Second-smallest prime factor of the n-th Lucas number (beginning with 2), if composite, or 1 otherwise.at n=38A194086
• Primes that are Lucas primes, or that can be written as the quotient of Lucas numbers.at n=28A201011
• Generalized Markoff numbers: largest of 7-tuple of positive numbers a, b, c, d, e, f, g satisfying the Markoff(7) equation a^2+b^2+c^2+d^2+e^2+f^2+g^2 = 7abcdefg.at n=17A227214
• 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=46A328697
• Prime numbersat n=1807486