32911

Properties

Appears in sequences

• Discriminants of totally complex sextic fields (negated).at n=34A023687
• Partitions encoded by interleaving bits in parts. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded in binary by recursively interleaving the bits of P1 with the (recursively interleaved bits of P2 with the (recursively...)).at n=41A059902
• a(1) = 2 then primes in nondecreasing order such that every concatenation is prime.at n=40A089702
• Binary transpose primes. Integers of k^2 bits which, when written row by row as a square matrix and then read column by column, are primes once transformed.at n=33A155967
• a(n) = 68*n^2 - 1.at n=21A158730
• Greater of twin primes p such that 3*p-2 is also greater of twin primes.at n=14A177336
• Primes p such that if q is the next prime after p then the concatenation of p with q and the concatenation of q with p are both primes.at n=40A225575
• Primes of the form abs(-66n^3 + 3845n^2 - 60897n + 251831) in order of increasing nonnegative n.at n=9A272438
• Prime numbers p such that p - 2, p^2 - p - 1, p^2 - p + 1 are prime numbers.at n=12A274525
• Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s.at n=3A297679
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s.at n=31A297682
• Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s.at n=4A297684
• a(n) is the smallest k > 2^n such that 2^(k-1) == 1 (mod (2^n-1)*k).at n=14A307512
• Emirp-indexed emirps: emirps with emirp subscripts.at n=33A326442
• Number of multiset partitions of integer partitions of n with all distinct block sizes.at n=19A358836
• Prime numbersat n=3527