Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133692 Expansion of phi(-q) * phi(q^2) in powers of q where phi() is a Ramanujan theta function. +0
4
1, -2, 2, -4, 2, 0, 4, 0, 2, -6, 0, -4, 4, 0, 0, 0, 2, -4, 6, -4, 0, 0, 4, 0, 4, -2, 0, -8, 0, 0, 0, 0, 2, -8, 4, 0, 6, 0, 4, 0, 0, -4, 0, -4, 4, 0, 0, 0, 4, -2, 2, -8, 0, 0, 8, 0, 0, -8, 0, -4, 0, 0, 0, 0, 2, 0, 8, -4, 4, 0, 0, 0, 6, -4, 0, -4, 4, 0, 0, 0, 0, -10, 4, -4, 0, 0, 4, 0, 4, -4, 0, 0, 0, 0, 0, 0, 4, -4, 2, -12, 2, 0, 8, 0 (list; graph; listen)
OFFSET

0,2

FORMULA

Expansion of eta(q)^2 * eta(q^4)^5 / ( eta(q^2)^3 * eta(q^8)^2 ) in powers of q.

Euler transform of period 8 sequence [ -2, 1, -2, -4, -2, 1, -2, -2, ...].

Moebius transform is period 16 sequence [ -2, 4, -2, 0, 2, 4, 2, 0, -2, -4, -2, 0, 2, -4, 2, 0, ...].

a(n) = -2 * b(n) where b(n) is multiplicative with b(2^e) = -1 if e>0, b(p^e) = (1 + (-1)^e) / 2 if p == 5, 7 (mod 8), b(p^e) = e + 1 if p == 1, 3 (mod 8).

a(8*n+5) = a(8*n+7) = 0.

G.f.: Product_{k>0} (1 - x^k)^2 * (1 + x^(2*k))^3 / (1 + x^(4*k))^2.

EXAMPLE

1 - 2*q + 2*q^2 - 4*q^3 + 2*q^4 + 4*q^6 + 2*q^8 - 6*q^9 - 4*q^11 + ...

PROGRAM

(PARI) {a(n) = if( n<1, n==0, (-1)^n * 2 * sumdiv(n, d, kronecker( -8, d)))}

(PARI) {a(n) = local(A); if ( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A)^2 * eta(x^4 + A)^5 / eta(x^2 + A)^3 / eta(x^8 + A)^2, n))}

CROSSREFS

A133690 is convolution square. (-1)^n * A033715(n) = a(n). A033715(n) = a(2*n). -2 * A113411(n) = a(2*n+1).

Sequence in context: A080963 A033715 A082564 this_sequence A139093 A080918 A033758

Adjacent sequences: A133689 A133690 A133691 this_sequence A133693 A133694 A133695

KEYWORD

sign

AUTHOR

Michael Somos, Sep 20 2007

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 December 4 21:30 EST 2008. Contains 151309 sequences.


AT&T Labs Research