92737

Properties

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1.at n=24A001588
• a(n) = least primitive factor of 2^(2n+1) - 1.at n=31A002184
• a(n+2) = a(n+1) + a(n) + (-1)^n, with a(1) = a(2) = 1.at n=25A066983
• a(n) is the smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number.at n=23A087384
• Expansion of (1 - x + 3*x^2 + 4*x^4 + 8*x^5 + 3*x^6 + x^7 + x^8) / ((1 + x)*(1 - x + x^2)*(1 - x - x^2)*(1 + x + 2*x^2 - x^3 + x^4)).at n=23A108391
• Expansion of (1 - x + 3*x^2 + 4*x^4 + 8*x^5 + 3*x^6 + x^7 + x^8) / ((1 + x)*(1 - x + x^2)*(1 - x - x^2)*(1 + x + 2*x^2 - x^3 + x^4)).at n=24A108391
• Primes of the form 2*F(k) + 1.at n=11A124081
• a(n) = 2*(A000045(n)-(n mod 2)) + 1 + (n mod 2).at n=24A166012
• Constant term in the reduction by (x^2 -> x + 1) of the polynomial p(n,x) defined below at Comments.at n=13A192908
• G.f. satisfies A(x) = 1 + x*A(x)^4 - x^2*A(x)^5.at n=8A200754
• Number of length 2+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.at n=11A245952
• Primes which are not the sums of two consecutive non-Fibonacci numbers.at n=17A257110
• Primes p such that p+2^4, p+2^6, p+2^8 and p+2^10 are all primes.at n=22A269258
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 2, a(3) = 1.at n=25A295686
• Primes p such that the sum of digits of 11*p is 11.at n=16A357935
• a(n) = A255978(n) + 1.at n=24A377368
• Smallest primitive prime factor of 8^n-1.at n=20A379641
• Prime numbersat n=8959