Search Results for ""

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...

The Fourier transform of e^(-k_0|x|) is given by F_x[e^(-k_0|x|)](k)=int_(-infty)^inftye^(-k_0|x|)e^(-2piikx)dx = ...

Let phi(t) be the characteristic function, defined as the Fourier transform of the probability density function P(x) using Fourier transform parameters a=b=1, phi(t) = ...

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

f(z)=k/((cz+d)^r)f((az+b)/(cz+d)) where I[z]>0.

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...

Let a>|b|, and write h(theta)=(acostheta+b)/(2sintheta). (1) Then define P_n(x;a,b) by the generating function f(x,w)=f(costheta,w)=sum_(n=0)^inftyP_n(x;a,b)w^n ...

The wave equation in prolate spheroidal coordinates is del ...

Q_n^((alpha,beta))(x)=2^(-n-1)(x-1)^(-alpha)(x+1)^(-beta) ×int_(-1)^1(1-t)^(n+alpha)(1+t)^(n+beta)(x-t)^(-n-1)dt. In the exceptional case n=0, alpha+beta+1=0, a nonconstant ...