Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110627
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110627 Bisection of A083952 such that the self-convolution is congruent modulo 4 to A083952, which consists entirely of 1's and 2's. +0
2
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 (list; graph; listen)
OFFSET

0,3

COMMENT

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

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.

PROGRAM

(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)))}

CROSSREFS

Cf. A083952, A111581, A084202, A108336.

Sequence in context: A065373 A047895 A164822 this_sequence A087187 A029380 A108129

Adjacent sequences: A110624 A110625 A110626 this_sequence A110628 A110629 A110630

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com) and Paul D. Hanna (pauldhanna(AT)juno.com), Aug 08 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research