|
| |
|
|
A109943
|
|
Maximal number of distinct primes in the solution of the n X n generalization of the Gordon Lee puzzle.
|
|
2
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| The Gordon Lee puzzle asks for an n X n array of single digits such that as many distinct primes as possible are formed by joining consecutive digits in any horizontal, vertical or diagonal direction, forward or backward. a(4)=63 was proved in March 2005 by Mike Oakes. a(5) and a(6) are conjectured best values that resisted any improvement since 1998.
a(5), a(6) and a(7) are conjectured best values that have resisted any improvement since 1998, including the joint effort of more than 100 participants in a programming contest in summer 2005. The best currently (September 2005) known lower bounds for the next terms are a(8)>=394 and a(9)>=527. - Hugo Pfoertner (hugo(AT)pfoertner.org), Sep 21 2005
|
|
|
LINKS
| Carlos Rivera, The Gordon Lee puzzle.
Carlos Rivera, Best Solutions
Eric Weisstein's World of Mathematics, Prime Array.
Al Zimmermann's Programming Contests. Primal Squares: Best grids for part 1 found during the contest.
|
|
|
CROSSREFS
| Cf. A032529 = all primes in the 3 X 3 record matrix, A034720 = number of candidates to be checked for primality in an n X n matrix of single digits.
A111128 gives the solutions to Part 2 of the contest.
Sequence in context: A162734 A163060 A051682 * A137411 A002755 A157827
Adjacent sequences: A109940 A109941 A109942 * A109944 A109945 A109946
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| Hugo Pfoertner (hugo(AT)pfoertner.org), Jul 05 2005
|
|
|
EXTENSIONS
| a(7) from Hugo Pfoertner (hugo(AT)pfoertner.org), Sep 21 2005
|
| |
|
|
