login
Smallest of n^2 primes in an arithmetic progression that form an n X n magic square with the least magic sum, or 0 if no such magic square exists.
1

%I #11 Mar 12 2016 22:23:27

%S 2,0,199,53297929

%N Smallest of n^2 primes in an arithmetic progression that form an n X n magic square with the least magic sum, or 0 if no such magic square exists.

%C a(n) > 0 for every n >= 3 under Dickson's conjecture.

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Magic_square">Magic square</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Primes_in_arithmetic_progression">Primes in arithmetic progression</a>

%H <a href="/index/Mag#magic">Index entries for sequences related to magic squares</a>

%H <a href="/index/Pri#primes_AP">Index entries for sequences related to primes in arithmetic progressions</a>

%Y Cf. A113827, A269325, A269904.

%K nonn,hard,more

%O 1,1

%A _Arkadiusz Wesolowski_, Mar 07 2016