19289

Properties

Appears in sequences

• Primes that remain prime through 3 iterations of function f(x) = 7x + 6.at n=26A023290
• T(2n-1,n-2), T given by A026692.at n=6A026697
• 3^n-th prime.at n=7A038833
• Primes p such that 8p +1 and (p-1)/8 are primes.at n=11A085958
• Primes p of the form 2*prime(k) + 3 such that 2*prime(k+1) + 3 is the next prime after p.at n=37A089528
• a(n) = prime(3^prime(n)).at n=3A096324
• Number of degeneracies on the sets of n ordinary trees with n vertices. These are the values of the Wiener number, W, in Table 15 of the paper by Elena V. Konstantinova and Maxim V. Vidyuk.at n=9A125081
• Primes congruent to 50 mod 53.at n=39A142580
• Primes congruent to 55 mod 59.at n=38A142782
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=7A151166
• Numbers k such that sigma(sigma(k)) is a Fibonacci number.at n=3A280545
• Primes p such that sigma(sigma(p)) is a Fibonacci number.at n=0A280555
• a(n) = prime(A003593(n)).at n=23A334276
• The (m^n)-th prime, written as square array T(n,m) read by falling antidiagonals.at n=42A347000
• a(n) is the smallest prime that starts the first occurrence of exactly n consecutive primes in A381019.at n=28A381616
• Prime numbersat n=2187