|
|
|
|
1, 3, 5, 6, 7, 13, 9, 19, 15, 17, 21, 25, 23, 31, 27, 33, 29, 35, 37, 39, 41, 45, 43, 49, 47, 51, 53, 55, 57, 59, 61, 67, 63, 69, 65, 73, 71, 77, 75, 79, 81, 85, 83, 91, 87, 93, 89, 95, 97, 99, 101, 105, 103, 107, 109, 111, 113, 119, 115, 117, 121, 123, 125, 131, 127, 129
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
PROG
|
(PARI) lista(nn) = { my(A=matrix(nn, nn)); S=Set(); for(s=2, nn+1, for(i=1, s-1, if(s%2, q=[i, s-i], q=[s-i, i]); p=[sum(j=1, q[2]-1, A[q[1], j]), sum(j=1, q[1]-1, A[j, q[2]])]; n=1; while(setsearch(S, n) || (p[1]&&isprime(p[1]+n)) || (p[2]&&!isprime(p[2]+n)), n++); A[q[1], q[2]]=n; S=setunion(S, Set([n])); if(q[1]==1, print1(n, ", ")); )) } \\ This is a modification of Max Alekseyev's PARI program from A082228. - Petros Hadjicostas, Feb 25 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|