Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110634
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110634 Every 2-nd term of A083946 where the self-convolution 2-nd power is congruent modulo 4 to A083946, which consists entirely of numbers 1 through 6. +0
3
1, 3, 3, 6, 3, 6, 6, 3, 6, 3, 6, 3, 6, 3, 6, 2, 6, 6, 6, 3, 6, 4, 6, 6, 4, 3, 3, 6, 3, 3, 3, 3, 6, 2, 3, 3, 1, 6, 6, 2, 6, 6, 3, 3, 6, 1, 6, 6, 6, 3, 6, 6, 3, 6, 1, 6, 6, 2, 3, 6, 6, 3, 3, 4, 6, 6, 2, 3, 6, 4, 3, 6, 2, 6, 3, 6, 3, 6, 2, 6, 6, 4, 3, 3, 2, 3, 3, 6, 3, 3, 5, 3, 3, 2, 6, 6, 2, 3, 6, 1, 3, 3, 5, 3, 6 (list; graph; listen)
OFFSET

0,2

EXAMPLE

A(x) = 1 + 3*x + 3*x^2 + 6*x^3 + 3*x^4 + 6*x^5 + 6*x^6 +...

A(x)^2 = 1 + 6*x + 15*x^2 + 30*x^3 + 51*x^4 + 66*x^5 +...

A(x)^2 (mod 4) = 1 + 2*x + 3*x^2 + 2*x^3 + 3*x^4 + 2*x^5 +...

G(x) = 1 + 6*x + 3*x^2 + 2*x^3 + 3*x^4 + 6*x^5 +...

where G(x) is the g.f. of A083946.

PROGRAM

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

CROSSREFS

Cf. A110632, A110633.

Sequence in context: A020813 A034188 A040007 this_sequence A151787 A113397 A007425

Adjacent sequences: A110631 A110632 A110633 this_sequence A110635 A110636 A110637

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com) and Paul D. Hanna (pauldhanna(AT)juno.com), Aug 30 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research