90481

Properties

Appears in sequences

• a(n) = (F(8*n+3) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).at n=3A049676
• a(n) = L(4*n+2)/3, where L=A000032 (the Lucas sequence).at n=6A049685
• 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=26A058036
• Primitive part of Lucas(n).at n=25A061447
• Primes of the form Lucas(2*n)/3.at n=2A074281
• Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists.at n=26A079451
• Order in which prime factors first occur in the Lucas sequence.at n=26A096362
• Iccanobirt numbers (9 of 15): a(n) = R(a(n-1) + a(n-2) + R(a(n-3))), where R is the digit reversal function A004086.at n=15A102119
• Iccanobirt primes (9 of 15): Prime numbers in A102119.at n=4A102159
• Numerator of Sum/Product of first n Fibonacci numbers A000045[n].at n=47A121708
• Triangle T(n, k) = (k*ChebyshevU(n, (k+2)/2) + 2*ChebyshevT(n+1, (k+2)/2))/2.at n=14A121872
• Expansion of (x-x^3)/(1-3*x+2*x^2-3*x^3+x^4).at n=13A140824
• Integer Quotients of Lucas Numbers; a rectangular array by downward antidiagonals.at n=29A143790
• a(n) = Product_{k=1..(n-1)/2} (5 + 4*cos(k*Pi/n)^2).at n=13A152119
• a(n) = L(13n)/L(n) where L(n) = Lucas number A000204(n).at n=1A153180
• Prime numbers that are Fibonacci integers.at n=35A178762
• Second-smallest prime factor of the n-th Lucas number (beginning with 2), if composite, or 1 otherwise.at n=26A194086
• Primes that are Lucas primes, or that can be written as the quotient of Lucas numbers.at n=24A201011
• Define a(x,y) to be 1 if x is 0 or 1 and y*a(x-1,y)-a(x-2,y) otherwise. Then the n-th term of the sequence is a(n,n).at n=7A218219
• Primes p such that both prevprime(p^2) - 2 and nextprime(p^2) + 2 are also primes.at n=27A226986