65507

Appears in sequences

• Hilltop maps: number of n X n binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..4 n X n array.at n=3A218280
• Hilltop maps: number of nX4 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..4 nX4 array.at n=3A218284
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..4 nXk array.at n=24A218288
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood.at n=15A279147
• Numbers k such that (8*10^k - 83)/3 is prime.at n=19A293851
• a(n) is the minimum integer k such that the smallest prime factor of the n-th Fermat number exceeds 2^(2^n - k).at n=16A358684
• On a 2 X n grid of vertices, draw a circle through every unordered triple of non-collinear vertices: a(n) is the number of distinct (finite) regions created.at n=8A384702