cp's OEIS Frontend

7th row, A(7,n), of the infinite array A(k,n) = 1 + Sum_{i=1..k} n^prime(i). If we deem prime(0) = 1, the array is A(k,n) = Sum_{i=0..k} n^prime(i). The first row is A002522 = 1 + n^2. The second row is A098547 = 1 + n^2 + n^3. The 3rd row, A(3,n), is A123650. The 4th row, A(4,n), is A123111 1 + n^2 + n^3 + n^5 + n^7. 10101101 (base n). A(n,n) is A123113 Main diagonal of prime power sum array. The current sequence, A(7,n), can never be prime, because of the polynomial factorization a(n) = 1 + n^2 + n^3 + n^5 + n^7 + n^11 + n^13 + n^17 = +/- (n^2+1)*(n^15 -n^13 +2n^11 -n^9 +n^7 +n^3 +1). It can be semiprime, as with a(2) and with a(10) = 100010100010101101 = 101 * 990199010001001 and a(14). We similarly have polynomial factorization for A123652 = A(13,n) = 1 +n^2 +n^3 +n^5 +...+ n^41.

13th row, A(13,n), of the infinite array A(k,n) = 1 + Sum_{i=1..k} n^prime(i). If we deem prime(0) = 1, the array is A(k,n) = Sum_{i=0..k} n^prime(i). The first row is A002522 = 1 + n^2. The second row is A098547 = 1 + n^2 + n^3. The 3rd row, A(3,n), is A123650. The 4th row, A(4,n), is A123111 1 +n^2 +n^3 +n^5 +n^7. 10101101 (base n). A(n,n) is A123113 Main diagonal of prime power sum array. The sequence A(13,n) = a(n) can never be prime because of the polynomial factorization. It can be semiprime, as with a(1) = 14 and a(2) = 2339155617965 = 5 * 467831123593 and a(6) and 100010000010100000100010100010100010101101 = 101 * 990198019901980199010000990199010001001. We similarly have polynomial factorization for the 7th row, A123651 = A(7,n) = 1 + n^2 + n^3 + n^5 + n^7 + n^11 + n^13 + n^17 = +/- (n^2+1)*(n^15-n^13+2n^11-n^9+n^7+n^3+1).