Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003982
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003982 Table read by rows: 1 if x = y, 0 otherwise, where (x,y) = (0,0),(0,1),(1,0),(0,2),(1,1),(2,0),... +0
1
1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; table; graph; listen)
OFFSET

0,1

COMMENT

Also called the delta function.

FORMULA

n-th 1 is followed by 4n-1 0's.

G.f.: 1/(1 - xy). E.g.f.: exp(xy).

Considered as a linear sequence, expansion of q^(-1/2)eta(q^8)^2/eta(q^4) in powers of q. If A(x) is the g.f., then B(x)=(x*A(x^2))^2 satisfies 0=f(B(x), B(x^2), B(x^4)) where f(u, v, w)=u^2*w -v^3 -4*v*w^2. Also, given g.f. A(x), then B(x)=x*A(x^2) satisfies 0=f(B(x), B(x^2), B(x^3), B(x^6)) where f(u1, u2, u3, u6)=u1*u2^2*u6 - u1*u6^3 - u3^3*u2. - Michael Somos Apr 13 2005

a(n)=b(2n+1) where b(n) is multiplicative and b(2^e)=0^e, b(p^e)=(1+(-1)^e)/2 if p>2. - Michael Somos Jun 06 2005

EXAMPLE

1; 0,0; 0,1,0; 0,0,0,0; 0,0,1,0,0; ...

PROGRAM

(PARI) a(n)=issquare(2*n+1) /* Michael Somos Apr 13 2005 */

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

(PARI) A(i, j)=i==j

CROSSREFS

Characteristic function of A001844. Antidiagonal sums and main diagonal is A000012.

Adjacent sequences: A003979 A003980 A003981 this_sequence A003983 A003984 A003985

Sequence in context: A014065 A014049 A016371 this_sequence A126010 A015857 A016343

KEYWORD

tabl,nonn,nice,easy

AUTHOR

Marc LeBrun (mlb(AT)well.com)

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research