Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,4

FORMULA

Moebius transform is period 32 sequence [ 1, -1, 1, 2, -1, -1, -1, 0, 1, 1, 1, 2, -1, 1, -1, 0, 1, -1, 1, -2, -1, -1, -1, 0, 1, 1, 1, -2, -1, 1, -1, 0, ...].

a(4n+2)= a(8n+5)= a(8n+7)= 0

PROGRAM

(PARI) {a(n)= if(n<1, n==0, qfrep([1, 0; 0, 8], n)[n] +qfrep([3, 1; 1, 3], n)[n])}

CROSSREFS

A125096(n)= a(n) unless n=0. A112603(n)=a(8n+1), A033761(n)=a(8n+3).

Sequence in context: A140344 A024158 A054978 this_sequence A125096 A037862 A032337

Adjacent sequences: A129435 A129436 A129437 this_sequence A129439 A129440 A129441

KEYWORD

nonn

AUTHOR

Michael Somos, Apr 14 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research