A382121 Minimal polynomials of nimbers *(2^(2^n)-1), evaluated at 2.

7, 25, 425, 101021, 7158330089, 27971386341277386797, 557019405516812760530014815489825522433, 200070165806576462487855236097886014378133571492030310620129377307348366314169

Offset

1,1

Comments

Each of these polynomials from n=1 up to n=12 is primitive: if you make a finite field of order 2^(2^n) as GF(2)[x]/<P(x)> then x generates the field's multiplicative group. A natural conjecture is that this is true for all n.

Links

Simon Tatham, Table of n, a(n) for n = 1..11

Example

For n=3, giving 2^n=8 and 2^(2^n)=256: let x be the nimber *255. Then the powers of x (under nim-multiplication) are *1, *255, *156, *61, *205, *200, *38, *71, *179. Under nim-addition, the subset of these powers *1 + *61 + *200 + *71 + *179 sum to *0. That is, 1+x^3+x^5+x^7+x^8 = 0. No sum of the powers up to and including x^7 is zero. So the polynomial 1+x^3+x^5+x^7+x^8 over GF(2) is the minimal polynomial of *255. Therefore the sequence entry for n=3 is the integer obtained by reinterpreting this polynomial as one over the integers and evaluating it at 2, i.e. 1+2^3+2^5+2^7+2^8 = 425.

Crossrefs

Cf. A051775 for definition of nim-multiplication.

Sequence in context: A385687 A364644 A197721 * A261421 A081298 A318633

Adjacent sequences: A382118 A382119 A382120 * A382122 A382123 A382124

Keyword

nonn

Author

Simon Tatham, Mar 16 2025

Status

approved