Dear Neil, Here it comes, additions to Sindx_Ge.html Sindx_Pol.html and Sindx_Z.html: Yours, Antti ------------------------------------------------------------------------ Addition to Sindx_Ge.html: GF(2)[X]-polynomials, sequences containing or operating on (start): (These sequences assume that GF(2)[X]-polynomial is encoded in binary expansion of n like this: n=11, 1011 in binary, stands for polynomial x^3+x+1, n=25, 11001 in binary, stands for polynomial x^4+x^3+1) GF(2)[X]-polynomials, addition table, i.e. XOR(x,y), A003987 GF(2)[X]-polynomials, bijections from/to natural numbers, preserving multiplicative structures, A091202-A091203, A091204-A091205 GF(2)[X]-polynomials, GCD(x,y), table of, A091255 GF(2)[X]-polynomials, irreducible, A014580*, A058943, A001037 GF(2)[X]-polynomials, irreducible and also prime in N, A091206 GF(2)[X]-polynomials, irreducible and non-primitive, A091252 GF(2)[X]-polynomials, irreducible and primitive, A091250*, A058947, A011260 GF(2)[X]-polynomials, irreducible but composite in N, A091214 GF(2)[X]-polynomials, irreducible, characteristic function, A091225 GF(2)[X]-polynomials, irreducible, order of each, A059478 GF(2)[X]-polynomials, LCM(x,y), table of, A091256 GF(2)[X]-polynomials, Matula-Goebel-tree analogues, A091238, A091239, A091240 GF(2)[X]-polynomials, Moebius-analogue, A091219 GF(2)[X]-polynomials, multiples of x+1, A048724 GF(2)[X]-polynomials, multiples of x+1, shifted once right, A003188 GF(2)[X]-polynomials, multiples of x^2+1, A048725 GF(2)[X]-polynomials, multiples of x^2+x, A048726 GF(2)[X]-polynomials, multiples of x^2+x+1, A048727 GF(2)[X]-polynomials, multiplication table, A048720, A091257 GF(2)[X]-polynomials, number of distinct irreducible divisors, A091221 GF(2)[X]-polynomials, number of divisors, A091220 GF(2)[X]-polynomials, number of irreducible divisors, A091222 GF(2)[X]-polynomials, of the form x^n+1, A000051 GF(2)[X]-polynomials, of the form x^n+1, number of distinct irreducible divisors, A000374 GF(2)[X]-polynomials, of the form x^n+1, number of irreducible divisors, A091248 GF(2)[X]-polynomials, powers of x+1, A001317 GF(2)[X]-polynomials, powers of x^2+1, A038183 GF(2)[X]-polynomials, powers of x^2+x+1, A038184 GF(2)[X]-polynomials, powers, table of, A048723 GF(2)[X]-polynomials, quasi-factorial analogue, A048631 GF(2)[X]-polynomials, reducible, A091242, A091254 GF(2)[X]-polynomials, reducible and also composite in N, A091212 GF(2)[X]-polynomials, reducible but prime in N, A091209 GF(2)[X]-polynomials, smallest m >= n, such that polynomial with code m is irreducible, A091228 GF(2)[X]-polynomials, squares, A000695 GF(2)[X]-polynomials: see also Trinomials over GF(2) ------------------------------------------------------------------------ Addition to Sindx_Pol.html: polynomials, over GF(2): see also GF(2)[X]-polynomials, sequences operating on
------------------------------------------------------------------------ Addition to Sindx_Z.html: Z2[X]-polynomials: see GF(2)[X]-polynomials, sequences operating on
------------------------------------------------------------------------ Yours, Antti Karttunen