28513

Properties

Appears in sequences

• Fibonacci sequence beginning 3, 16.at n=17A022126
• Primes that remain prime through 4 iterations of function f(x) = 10x + 9.at n=12A023329
• Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 19.at n=11A031607
• Lesser member p of cousin primes (p, p+4) such that (p+1, p+2, p+3) all have the same number of prime divisors (counted with multiplicity).at n=23A094230
• a(n) = sum of n Fibonacci numbers starting from F(n).at n=11A096140
• Primes that are the difference of two Fibonacci numbers; primes in A007298.at n=28A113188
• Primes of the form 22*(n^2)+1.at n=17A117049
• Convolution of A066983 with the double Fibonacci sequence A103609.at n=22A121364
• a(n) = Sum_{k=floor((n+1)/2)..n} Fibonacci(k+1).at n=20A129361
• a(n) = 22*n^2 + 1.at n=36A158537
• The smallest A(m) such that the interval (A(m)*n, A(m+1)*n) contains exactly one element of A, where A is the sequence of primes p for which p-2 is not prime.at n=18A201828
• Primes of the form 3^x + y^3 with x, y >0.at n=34A250716
• Compound filter: a(n) = P(sigma(n), sigma(2n)), where P(n,k) is sequence A000027 used as a pairing function, and sigma is the sum of divisors (A000203).at n=29A286359
• Compound filter: a(n) = P(sigma(n), sigma(2n)), where P(n,k) is sequence A000027 used as a pairing function, and sigma is the sum of divisors (A000203).at n=45A286359
• Primes in A301916 but not in A045318.at n=29A320481
• Primes p such that p == 1 (mod A001414(p-1)) and p == 1 (mod A001414(p+1)).at n=11A339181
• Prime numbersat n=3101