63487

Properties

Appears in sequences

• Smallest prime with Hamming weight n (i.e., with exactly n 1's when written in binary).at n=14A061712
• T(3,n) with T(n,m) as in A063394.at n=10A063396
• Winning binary "same game" templates of length n as defined below.at n=15A066345
• Smallest prime between 2^n and 2^(n+1), having a maximal number of 1's in binary representation.at n=14A091938
• Primes with a single 0 bit in their binary expansion.at n=31A095078
• Lucas 8-step numbers.at n=15A105754
• Acyclic 3-multidigraphs on n nodes.at n=4A137435
• a(n) = 62*n^2 - 1.at n=31A158680
• Let a(0) = 1. Either, a(n) = the smallest prime not yet occurring in the sequence that, when written in binary, it is a substring in the binary representation of a(n-1); or, if no such prime exists, a(n) = the smallest prime not yet occurring that when written in binary, a(n-1) is contained as a substring within it.at n=36A175310
• Primes of the form 2^t-2^k-1, k>=1.at n=35A181741
• Primes of the form (2^k - k)*2^k - 1.at n=3A200819
• Numbers in A206853 without proper divisors > 1 from the same sequence.at n=36A209630
• Smallest prime with at least n 1's when written in binary.at n=13A211997
• Smallest prime with at least n 1's when written in binary.at n=14A211997
• Primes in the union of all n-step Lucas sequences.at n=36A227885
• Primes that set a new record for the Hamming weight.at n=12A278477
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=15A289584
• Initial member of 9 consecutive primes {a, b, c, d, e, f, g, h, i} such that (a + b + c)/3, (d + e + f)/3 and (g + h + i)/3 are all prime.at n=0A294147
• Primes of the form q*2^h - 1, where q is a Mersenne prime (A000668).at n=15A335874
• Primes p such that the 3 X 3 matrix with components (row by row) prime(k+m), 0 <= m <= 8 has zero determinant, where p = prime(k).at n=9A337160