34981

Properties

Appears in sequences

• Number of 3-edge-colored trivalent graphs with 2n nodes.at n=7A002830
• Lower prime of the second gap of 2n between primes.at n=20A046789
• Prime islands: for n >= 2, a(n) = least prime whose adjacent primes are exactly 2n apart; a(1) = 3 by convention.at n=29A046931
• Smallest primes whose residue modulo its difference from the next prime is 2n-1.at n=18A060235
• Primes of the form 2^i*3^j - (i+j) with i, j >= 0.at n=17A069356
• Primes p such that (r-p)/log(p) > 4, where r is the next prime after p.at n=11A082889
• prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 11.at n=12A109565
• Numbers appearing in A122072 at least four times.at n=23A122390
• Primes p such that q-p = 42, where q is the next prime after p.at n=1A134120
• Primes of the form k^2 + 12.at n=27A138368
• Primes p of the form : p+p^2+p^3-+4=prime.at n=12A154822
• Primes of the form Sum_{k=1..m} (m^k mod (m+k)).at n=25A156557
• Primes of the form 2^x+x*y+2^y, with x and y integers of any sign.at n=16A162573
• Primes of the form 8*n^2 + 2*n + 1.at n=29A188382
• Primes p=prime(i) of level (1,4), i.e., such that A118534(i) = prime(i-4).at n=12A216177
• Total number of smallest parts that are also emergent parts in all partitions of n with at least one distinct part: a(n) = n + d(n) + p(n-1) + spt(n) - A000070(n) - sigma(n) - 1.at n=45A220483
• Number of ways to reciprocally link elements of an nX6 array either to themselves or to exactly two horizontal and vertical neighbors, without consecutive collinear links.at n=6A220612
• Number of ways to reciprocally link elements of an nX7 array either to themselves or to exactly two horizontal and vertical neighbors, without consecutive collinear links.at n=5A220613
• a(n) = smallest prime(j) > a(n-1) such that prime(j+1) - prime(j) = 2n, a(0) = 2.at n=21A256454
• Prime numbers in A317298.at n=30A306362