163841

Properties

Appears in sequences

• a(n) = T(n, 2*n-6), T given by A027960.at n=20A027968
• 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 32.at n=19A031620
• a(n) = prime(1000 * n).at n=14A031922
• Primes of form 5*2^n+1.at n=4A050526
• a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).at n=15A057775
• a(n) = n*8^n + 1.at n=5A064746
• Primes that can be formed by concatenating 2^a and 3^b.at n=38A068801
• Smallest prime larger than 2^n whose digits begin with those of 2^n.at n=14A068842
• Primes of form 2^x + 2^y + 1.at n=39A070739
• Primes of the form 2^r*5^s + 1.at n=19A077497
• Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,2).at n=8A078968
• Primes of the form 2^i + 2^j + 1, i > j > 0.at n=34A081091
• Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=17A082605
• a(0) = 6; for n>0, a(n) = 2*a(n-1) - 1.at n=15A083575
• Smallest prime of the form an n-th power followed by digit 1.at n=13A089318
• Primes p such that p, p+6, p+12, p+18 are consecutive primes and p=6*k+5 for some k.at n=25A090834
• a(n) is the first term of the sexy prime quadruple a(n), a(n)+6, a(n)+12 and a(n)+18 that becomes a perfect square if the rightmost digit (1) is removed.at n=7A092445
• Elite primes: a prime number p is called elite if only a finite number of Fermat numbers 2^(2^n)+1 are quadratic residues mod p.at n=9A102742
• a(n) = n-th element of n-th row of triangle shown below.at n=20A115025
• 1 + (n+6)*2^(n-1).at n=14A115618