A083954 Least integer coefficients of A(x), where 1<=a(n)<=4, such that A(x)^(1/4) consists entirely of integer coefficients.
1, 4, 2, 4, 3, 4, 4, 4, 1, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 4, 2, 4, 2, 4, 4, 4, 4, 4, 3, 4, 2, 4, 2, 4, 2, 4, 3, 4, 2, 4, 3, 4, 2, 4, 4, 4, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 2, 4, 2, 4, 1, 4, 4, 4, 1, 4, 2, 4, 4, 4, 4, 4, 1, 4, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 2, 4, 2, 4, 2, 4, 2, 4, 1, 4, 4, 4, 1, 4, 2, 4, 3
Offset: 0
Keywords
Links
- Robert G. Wilson v, Table of n, a(n) for n = 0..5000.
- N. Heninger, E. M. Rains and N. J. A. Sloane, On the Integrality of n-th Roots of Generating Functions, arXiv:math/0509316 [math.NT], 2005-2006; J. Combinatorial Theory, Series A, 113 (2006), 1732-1745.
Programs
-
Mathematica
a[0] = 1; a[n_] :=a[n] = Block[{k=1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/4), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 104}] (* Robert G. Wilson v, Jul 26 2005 *)
-
PARI
A083954_upto(N=99)=vector(N+1, n, if(n>1, for(k=1,4, denominator(polcoeff(sqrtn(O(x^n)+N+=x^(n-1), 4), n-1))>1|| [n=k, break]); n, N=1)) \\ _M. F. Hasler, Jan 27 2025
Extensions
More terms from Robert G. Wilson v, Jul 26 2005
Comments