Search Results for ""
321 - 330 of 1537 for sequenceSearch Results
Polynomials m_k(x;beta,c) which form the Sheffer sequence for g(t) = ((1-c)/(1-ce^t))^beta (1) f(t) = (1-e^t)/(c^(-1)-e^t) (2) and have generating function ...
Polynomials M_k(x) which form the associated Sheffer sequence for f(t)=(e^t-1)/(e^t+1) (1) and have the generating function sum_(k=0)^infty(M_k(x))/(k!)t^k=((1+t)/(1-t))^x. ...
Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...
By way of analogy with the eban numbers, oban numbers are defined as numbers whose English names do not contain the letter "o" (i.e., "o" is banned). Note that this ...
An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...
Polynomials P_k(x) which form the Sheffer sequence for g(t) = (2t)/(e^t-1) (1) f(t) = (e^t-1)/(e^t+1) (2) and have generating function ...
Write the exact powers of 2 and 3 in sorted order as 1, 2, 3, 4, 8, 9, 16, 27, 32, ... (OEIS A006899), and let u_n be the nth term in the sequence. Then u_(n+1)-u_n tends to ...
The Poisson-Charlier polynomials c_k(x;a) form a Sheffer sequence with g(t) = e^(a(e^t-1)) (1) f(t) = a(e^t-1), (2) giving the generating function ...
The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...
The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...
...
View search results from all Wolfram sites (10957 matches)

