|
%I #8 Jan 02 2019 11:54:19
%S 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,
%T 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,
%U 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,0,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,1,1,1,0,2
%N 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.
%C This is a three-dimensional generalization of A083382.
%D See A083382 for references and links to the two-dimensional case.
%H Antti Karttunen, <a href="/A084928/b084928.txt">Table of n, a(n) for n = 1..900</a>
%e For the case n=3, the numbers are arranged in a cubic array as follows:
%e 1..2..3........10.11.12........19.20.21
%e 4..5..6........13.14.15........22.23.24
%e 7..8..9........16.17.18........25.26.27
%e 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.
%t 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}]
%o (PARI) A084928(n) = { my(m=-1); for(i=0,(n^2)-1,my(s=sum(j=(i*n),((i+1)*n)-1,isprime(1+j))); if((m<0) || (s < m), m = s)); (m); }; \\ _Antti Karttunen_, Jan 01 2019
%Y Cf. A083382, A083414, A084927 (top view), A084929 (north-south view).
%K nonn
%O 1,121
%A _T. D. Noe_, Jun 12 2003
%E More terms from _Antti Karttunen_, Jan 01 2019
|
