

A090414


Triangular array read by rows, 1<=k<=n: T(n,k) = smallest prime that in binary representation is not contained in n^k.


2



2, 3, 3, 2, 3, 7, 3, 3, 3, 3, 3, 5, 11, 5, 7, 5, 3, 7, 3, 5, 7, 2, 5, 13, 7, 11, 13, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 7, 7, 11, 19, 19, 17, 13, 3, 5, 11, 5, 7, 11, 7, 17, 17, 13, 7, 5, 7, 5, 23, 7, 13, 7, 7, 17, 17, 5, 3, 7, 3, 5, 7, 7, 7, 5, 11, 17, 19
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS



EXAMPLE

Triangle begins:
2;
3, 3;
2, 3, 7;
3, 3, 3, 3;
3, 5, 11, 5, 7;
5, 3, 7, 3, 5, 7;
2, 5, 13, 7, 11, 13, 17;
..


PROG

(PARI) T(n, k) = {my(d=binary(n^k), v); forprime(p=2, oo, v=binary(p); if(#v>#d  sum(i=1, #d#v+1, v==vector(#v, j, d[i+j1]))==0, return(p))); } \\ Jinyuan Wang, Mar 01 2020


CROSSREFS



KEYWORD



AUTHOR



EXTENSIONS



STATUS

approved



