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.

A162570 Positive integers n such that the polynomial P(n,t) = t^{2^{n-1}} * (t+1)^{2^{n-1}-1} + 1 of GF(2)[t] is irreducible, where GF(2) = {0,1} is the binary finite field with two elements.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 15
Offset: 1

Views

Author

Luis H. Gallardo, Jul 06 2009

Keywords

Examples

			For n=1 the polynomial P(1,t)=t+1 is irreducible in GF(2)[t]. For n=3 the polynomial P(3,t)=t^4(t+1)^3+1 = t^7+t^6+t^5+t^4+1 is irreducible in GF(2)[t].
		

Programs

  • PARI
    isok(n) = polisirreducible(Mod(1,2)*(t^(2^(n-1))*(t+1)^(2^(n-1)-1)+1)); \\ Michel Marcus, Aug 14 2013