Search Results for ""
1041 - 1050 of 2765 for Linear Recurrence EquationSearch Results
Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...
11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...
The integral transform defined by g(x)=int_1^inftyt^(1/4-nu/2)(t-1)^(1/4-nu/2)P_(-1/2+ix)^(nu-1/2)(2t-1)f(t)dt (Samko et al. 1993, p. 761) or ...
The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...
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. ...
Let generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] (1) have p=q+1. Then the generalized hypergeometric function is said to ...
The nested radical constant is the constant defined by C = sqrt(1+sqrt(2+sqrt(3+sqrt(4+sqrt(5+...))))) (1) = 1.75793275... (2) (OEIS A072449). No closed-form expression is ...
A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...
Parallel computing is the execution of a computer program utilizing multiple computer processors (CPU) concurrently instead of using one processor exclusively. Let T(n,1) be ...
The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...
...
View search results from all Wolfram sites (38365 matches)

