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.

A110627 Bisection of A083952 such that the self-convolution is congruent modulo 4 to A083952, which consists entirely of 1's and 2's.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 1, 1, 2, 2, 2
Offset: 0

Views

Author

Keywords

Comments

Congruent modulo 2 to A084202 and A108336; the self-convolution of A084202 equals A083952.

Crossrefs

Programs

  • PARI
    {a(n)=local(p=2,A,C,X=x+x*O(x^(p*n)));if(n==0,1, A=sum(i=0,n-1,a(i)*x^(p*i))+p*x*((1-x^(p-1))/(1-X))/(1-X^p); for(k=1,p,C=polcoeff((A+k*x^(p*n))^(1/p),p*n); if(denominator(C)==1,return(k);break)))}

Formula

a(n) = A083952(2*n) for n>=0. G.f. satisfies: A(x^2) = G(x) - 2*x/(1-x^2), where G(x) is the g.f. of A083952. G.f. satisfies: A(x)^2 = A(x^2) + 2*x/(1-x^2) + 4*x^2*H(x) where H(x) is the g.f. of A111581.