59257

Appears in sequences

• Let [n] = {1,2,...,n}. Let G_n be the union of all closed line segments joining any two elements of [n] X [n] along a vertical or horizontal line, or along a line with slope +-1. Then a(n) = combined total of the number of (nondegenerate) triangles and rectangles for which all edges are subsets of G_n.at n=15A098921
• Numbers k such that k + googol is a lower twin prime.at n=2A133281
• Number of tilings of a 6 X n rectangle using integer-sided square tiles.at n=7A219925
• Number of tilings of a 7 X n rectangle using integer-sided square tiles.at n=6A219926
• a(n)=least number m such that gcd(prime(m)+2,prime(m+1)+2) = 2*n-1.at n=19A268863
• Numbers m that generate rotationally symmetrical XOR-triangles T(m) that have central triangles of zeros.at n=39A334769
• a(n) is the least k such that there are exactly n primes between prime(k) + 1 and floor(prime(k + 1)^2/prime(k)) (inclusive) or 0 if no such k exists.at n=11A344582