cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 30 2003

Keywords

Examples

			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;
..
		

Crossrefs

Programs

  • 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

Extensions

More terms from Jinyuan Wang, Mar 01 2020