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.

A110648 Every third term of A084067 where the self-convolution third power is congruent modulo 9 to A084067, which consists entirely of numbers 1 through 12.

This page as a plain text file.
%I A110648 #6 Mar 30 2012 18:36:50
%S A110648 1,4,4,8,6,12,8,12,12,12,10,12,2,8,12,4,8,8,4,4,9,4,4,12,2,12,6,8,7,4,
%T A110648 8,12,12,8,12,8,2,8,2,8,3,12,4,12,4,12,2,12,9,12,6,12,10,8,6,12,12,12,
%U A110648 2,8,9,12,10,12,2,8,2,4,5,4,6,12,12,8,2,12,9,4,8,4,8,12,8,4,10,8,8,12,1,12
%N A110648 Every third term of A084067 where the self-convolution third power is congruent modulo 9 to A084067, which consists entirely of numbers 1 through 12.
%e A110648 A(x) = 1 + 4*x + 4*x^2 + 8*x^3 + 6*x^4 + 12*x^5 +...
%e A110648 A(x)^3 = 1 + 12*x + 60*x^2 + 184*x^3 + 450*x^4 + 948*x^5 +...
%e A110648 A(x)^3 (mod 9) = 1 + 3*x + 6*x^2 + 4*x^3 + 3*x^5 + 4*x^6 +...
%e A110648 G(x) = 1 + 12*x + 6*x^2 + 4*x^3 + 9*x^4 + 12*x^5 + 4*x^6 +...
%e A110648 where G(x) is the g.f. of A084067.
%o A110648 (PARI) {a(n)=local(d=3,m=12,A=1+m*x); for(j=2,d*n, for(k=1,m,t=polcoeff((A+k*x^j+x*O(x^j))^(1/m),j); if(denominator(t)==1,A=A+k*x^j;break)));polcoeff(A,d*n)}
%Y A110648 Cf. A084067, A110645, A110646, A110647, A110649.
%K A110648 nonn
%O A110648 0,2
%A A110648 _Robert G. Wilson v_ and _Paul D. Hanna_, Aug 30 2005