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.

A220072 Least prime p such that sum_{k=0}^n A005117(k+1)*x^{n-k} is irreducible modulo p.

This page as a plain text file.
%I A220072 #37 Mar 28 2013 11:45:19
%S A220072 2,5,2,7,11,31,13,19,89,17,37,37,43,19,137,29,3,7,2,19,13,59,139,37,2,
%T A220072 239,31,337,487,97,337,97,307,181,223,19,79,401,2,491,269,211,97,193,
%U A220072 719,149,97,191,83,613
%N A220072 Least prime p such that sum_{k=0}^n A005117(k+1)*x^{n-k} is irreducible modulo p.
%C A220072 Conjecture: For any n>0, we have a(n) <= n*(n+1), and the Galois group of SF_n(x) = sum_{k=0}^n A005117(k+1)*x^{n-k} over the rationals is isomorphic to the symmetric group S_n.
%C A220072 For another related conjecture, see the author's comment on A005117.
%H A220072 Zhi-Wei Sun, <a href="/A220072/b220072.txt">Table of n, a(n) for n = 1..350</a>
%e A220072 a(4)=7 since SF_4(x)=x^4+2x^3+3x^2+5x+6 is irreducible modulo 7 but reducible modulo any of 2, 3, 5. It is easy to check that SF_4(x)==(x-2)*(x^3-x^2+x+2) (mod 5).
%Y A220072 Cf. A005117, A217785, A217788, A218465.
%K A220072 nonn
%O A220072 1,1
%A A220072 _Zhi-Wei Sun_, Mar 28 2013