Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

EXAMPLE

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

A(x)^3 = 1 + 9*x + 36*x^2 + 84*x^3 + 144*x^4 + 252*x^5 +...

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

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

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

PROGRAM

(PARI) {a(n)=local(d=3, m=9, 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. A083949, A110639.

Sequence in context: A165202 A010468 A082009 this_sequence A143389 A094040 A039798

Adjacent sequences: A110637 A110638 A110639 this_sequence A110641 A110642 A110643

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research