19633

Appears in sequences

• Numbers k such that A003285(k) = A003285(k+1) == 1 (mod 2).at n=0A065304
• a(n) is the smallest number for which the prime distance A051699 is equal to n.at n=24A077019
• Least positive k such that the distance from k to closest prime = n.at n=24A079582
• Numerators in expansion of 1/sqrt(1-x-x^2*c(x^2)), c(x) the g.f. of A000108.at n=7A110120
• Number of ordered triples (i,j,k) in range [0..n] satisfying i == j mod 2 and j == k mod 3.at n=48A115520
• Numbers n such that 6*p(n)-1 and 6*p(n)+1 are twin primes and 6*p(n+1)-1 and 6*p(n+1)+1 are also twin primes with p(n) = n-th prime.at n=27A126655
• Integers of the form (x^3)/6 + (x^2)/2 + x + 1.at n=16A127876
• Smallest number at distance exactly 3n from nearest prime.at n=8A132470
• Smallest number at distance 2n from nearest prime (variant 2).at n=12A132860
• Expansion of g.f. -x*(10*x^4+12*x^3-x^2-3*x-3)/((x^2+x-1)*(4*x^3+x^2-x-1)).at n=18A134704
• Members of A038512 of the form k, k+2, k+6, k+8.at n=33A155511
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|>=|x-y|+|y-z|.at n=17A212574
• a(n) is the position of the first occurrence of 2n as a local minimum in the prime gaps (A001223).at n=12A286711
• MM-numbers of crossing set partitions.at n=21A324324