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.

Showing 1-4 of 4 results.

A110649 Every 2nd term of A084067 where the self-convolution 2nd power is congruent modulo 8 to A084067, which consists entirely of numbers 1 through 12.

Original entry on oeis.org

1, 6, 9, 4, 12, 6, 6, 12, 12, 8, 9, 12, 12, 6, 6, 10, 6, 12, 2, 6, 6, 12, 12, 12, 8, 12, 3, 4, 12, 12, 9, 6, 6, 4, 12, 12, 2, 6, 3, 6, 3, 6, 7, 6, 9, 8, 9, 12, 12, 12, 3, 12, 3, 6, 2, 6, 12, 2, 6, 6, 3, 12, 9, 4, 3, 12, 4, 12, 6, 2, 3, 12, 9, 6, 6, 6, 3, 6, 10, 6, 6, 6, 9, 6, 12, 12, 9, 2, 12, 6, 9
Offset: 0

Views

Author

Keywords

Examples

			A(x) = 1 + 6*x + 9*x^2 + 4*x^3 + 12*x^4 + 6*x^5 +...
A(x)^2 = 1 + 12*x + 54*x^2 + 116*x^3 + 153*x^4 + 228*x^5 +...
A(x)^2 (mod 8) = 1 + 4*x + 6*x^2 + 4*x^3 + x^4 + 4*x^5 +...
G(x) = 1 + 12*x + 6*x^2 + 4*x^3 + 9*x^4 + 12*x^5 + 4*x^6 +...
where G(x) is the g.f. of A084067.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(d=2,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)}

A110646 Every 6th term of A084067.

Original entry on oeis.org

1, 4, 6, 8, 12, 10, 2, 12, 8, 4, 9, 4, 2, 6, 7, 8, 12, 12, 2, 2, 3, 4, 4, 2, 9, 6, 10, 6, 12, 2, 9, 10, 2, 2, 5, 6, 12, 2, 9, 8, 8, 8, 10, 8, 1, 4, 9, 10, 7, 10, 2, 6, 9, 10, 4, 8, 11, 2, 1, 4, 10, 2, 5, 2, 4, 2, 1, 8, 12, 2, 2, 12, 9, 2, 4, 4, 5, 8, 11, 4, 12, 4, 12, 6, 9, 12, 5, 6, 12, 10, 5, 12, 3
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    {a(n)=local(d=6,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)}

A110647 Every 4th term of A084067 where the self-convolution 4th power is congruent modulo 8 to A084067, which consists entirely of numbers 1 through 12.

Original entry on oeis.org

1, 9, 12, 6, 12, 9, 12, 6, 6, 2, 6, 12, 8, 3, 12, 9, 6, 12, 2, 3, 3, 7, 9, 9, 12, 3, 3, 2, 12, 6, 3, 9, 3, 4, 6, 3, 9, 6, 3, 10, 6, 9, 12, 9, 12, 9, 9, 6, 2, 9, 12, 5, 3, 6, 12, 9, 6, 9, 12, 6, 8, 6, 12, 10, 9, 12, 1, 9, 3, 9, 12, 6, 7, 12, 12, 2, 9, 3, 9, 12, 12, 4, 9, 9, 11, 6, 6, 1, 9, 6, 10, 3, 12
Offset: 0

Views

Author

Keywords

Examples

			A(x) = 1 + 9*x + 12*x^2 + 6*x^3 + 12*x^4 + 9*x^5 +...
A(x)^4 = 1 + 36*x + 534*x^2 + 4236*x^3 + 19785*x^4 +...
A(x)^4 (mod 8) = 1 + 4*x + 6*x^2 + 4*x^3 + x^4 + 4*x^5 +...
G(x) = 1 + 12*x + 6*x^2 + 4*x^3 + 9*x^4 + 12*x^5 + 4*x^6 +...
where G(x) is the g.f. of A084067.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(d=4,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)}

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.

Original entry on oeis.org

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, 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, 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
Offset: 0

Views

Author

Keywords

Examples

			A(x) = 1 + 4*x + 4*x^2 + 8*x^3 + 6*x^4 + 12*x^5 +...
A(x)^3 = 1 + 12*x + 60*x^2 + 184*x^3 + 450*x^4 + 948*x^5 +...
A(x)^3 (mod 9) = 1 + 3*x + 6*x^2 + 4*x^3 + 3*x^5 + 4*x^6 +...
G(x) = 1 + 12*x + 6*x^2 + 4*x^3 + 9*x^4 + 12*x^5 + 4*x^6 +...
where G(x) is the g.f. of A084067.
		

Crossrefs

Programs

  • 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)}
Showing 1-4 of 4 results.