|
Search: id:A084928
|
|
|
| A084928 |
|
If the numbers 1 to n^3 are arranged in a cubic array, a(n) is the minimum number of primes in each row of the n^2 rows in the "east-west view" that can have primes. |
|
+0
3
|
|
| 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This is a three-dimensional generalization of A083382.
|
|
REFERENCES
|
See A083382 for references and links to the two-dimensional case.
|
|
EXAMPLE
|
For the case n=3, the numbers are arranged in a cubic array as follows:
1..2..3........10.11.12........19.20.21
4..5..6........13.14.15........22.23.24
7..8..9........16.17.18........25.26.27
The first row is (1,2,3), the second is (4,5,6), etc. Surprisingly, a(n) = 0 for all n from 3 to 66. It appears that a(n) > 0 for n > 128. This has been confirmed up to n = 1000.
|
|
MATHEMATICA
|
Table[minP=n; Do[s=0; Do[If[PrimeQ[n*(c-1)+r], s++ ], {r, n}]; minP=Min[s, minP], {c, n^2}]; minP, {n, 100}]
|
|
CROSSREFS
|
Cf. A083382, A083414, A084927 (top view), A084929 (north-south view).
Sequence in context: A157928 A159075 A063524 this_sequence A033683 A130638 A030217
Adjacent sequences: A084925 A084926 A084927 this_sequence A084929 A084930 A084931
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Jun 12 2003
|
|
|
Search completed in 0.002 seconds
|
