31429

Appears in sequences

• Lonely numbers: distance to closest prime sets a new record.at n=19A051650
• Smallest number at distance n from nearest prime.at n=32A051652
• Smallest number at distance 2n from nearest prime.at n=16A051728
• a(n) is the smallest number for which the prime distance A051699 is equal to n.at n=32A077019
• Least positive k such that the distance from k to closest prime = n.at n=32A079582
• Smallest number at distance 2n from nearest prime (variant 2).at n=16A132860
• Smallest number at distance 2n from nearest prime (variant 3).at n=16A133490
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150495
• Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with no more than 9 ones in any 4 X 4 X 4 subtriangle.at n=9A153965
• Number of lower triangles of an (n+8) X (n+8) 0..5 array with new values introduced in row major order 0..5 and no element unequal to more than one horizontal or vertical neighbor.at n=3A194775
• T(n,k)=Number of lower triangles of an (n+2k-2)X(n+2k-2) 0..k array with new values introduced in row major order 0..k and no element unequal to more than one horizontal or vertical neighbor.at n=31A194778
• Number of lower triangles of a (2n+2)X(2n+2) 0..n array with new values introduced in row major order 0..n and no element unequal to more than one horizontal or vertical neighbor.at n=4A194782
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=17A294414
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + 2*b(n-2) - b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A295361
• List of indices where the maximum of {A316190(j) | j<=n} increases.at n=17A316191