The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Jinyuan Wang, Rows n = 1..100 of triangle, flattened 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+j-1]))==0, return(p))); } \\ Jinyuan Wang, Mar 01 2020 CROSSREFS Cf. A004676, A007088, A075363. Sequence in context: A141744 A089783 A302939 * A068227 A235343 A236456 Adjacent sequences: A090411 A090412 A090413 * A090415 A090416 A090417 KEYWORD nonn,base,tabl AUTHOR Reinhard Zumkeller, Nov 30 2003 EXTENSIONS More terms from Jinyuan Wang, Mar 01 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 10:56 EST 2023. Contains 367589 sequences. (Running on oeis4.)