In the following square array A(n,k), numbers (not occurring earlier) are entered like this, A(1, 1), A(1, 2), A(2, 1), A(3, 1), A(2, 2), A(1, 3), A(1, 4), A(2, 3), A(3, 2), A(4, 1), A(5, 1), A(4, 2), ... such that every partial sum (of length > 1) of the rows is composite and every partial sum (of length > 1) of the columns is prime. The sequence contains the terms in the order in which they are entered (with A(1,1) = 1).
A082228
In the following square array A(n,k), numbers (not occurring earlier) are entered like this, A(1, 1), A(1, 2), A(2, 1), A(3, 1), A(2, 2), A(1, 3), A(1, 4), A(2, 3), A(3, 2), A(4, 1), A(5, 1), A(4, 2), ... such that every partial sum (of length > 1) of the rows is composite and every partial sum (of length > 1) of the columns is prime. The sequence contains the terms in the order in which they are entered (with A(1,1) = 1).
Terms
- a(0) =1a(1) =3a(2) =2a(3) =4a(4) =8a(5) =5a(6) =6a(7) =12a(8) =18a(9) =10a(10) =14a(11) =24a(12) =20a(13) =11a(14) =7a(15) =13a(16) =16a(17) =26a(18) =22a(19) =30a(20) =28a(21) =38a(22) =44a(23) =42a(24) =36a(25) =48a(26) =46a(27) =9a(28) =19a(29) =34
External references
- oeis: A082228