59393

Properties

Appears in sequences

• Primes that remain prime through 3 iterations of function f(x) = 3x + 4.at n=25A023278
• Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=14A023312
• Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=11A051900
• Primes of the form 512*k+1.at n=21A076339
• Duplicate of A051900.at n=11A084706
• Number of partitions of an n-set with an even number of blocks of size 1.at n=9A111724
• Least prime of the form 1 + p*2^n, where p is an odd prime.at n=10A134854
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, 1), (1, -1)}.at n=13A151390
• This sequence of prime numbers reproduces itself (without its "tail") when the last digit of each term is erased.at n=18A155873
• a(n) = 58*n^2 + 1.at n=32A158666
• Primes p such that the equation x^64 == -2 (mod p) has a solution, and ord_p(-2) is even.at n=2A163186
• 0-sequence of reduction of (n^2) by x^2 -> x+1.at n=13A192254
• Primes of the form 232*m^2+1.at n=11A230392
• Primes formed by an m-digit prime concatenated with its last (m-1) digits, for m > 1.at n=26A252667
• Odd prime factors of generalized Fermat numbers of the form 3^(2^m) + 1 with m >= 0.at n=6A273945
• Primes p such that S_e(p-1)/S_o(p-1) is an integer, where S_e(x) is the sum of the even numbers and S_o(x) is the sum of the odd numbers in the Collatz iteration of x.at n=5A275584
• Sophie Germain primes p such that p+6 and p-6 are primes.at n=39A278869
• Number of nX3 0..1 arrays with every element equal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=11A300460
• Primes p such that the order of 2 mod p is less than the square root of p.at n=39A333245
• Prime numbersat n=6004