Search Results for ""

The Pell polynomials P(x) are the W-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. This gives recursive equations for P(x) from ...

A figurate number corresponding to a pentagonal pyramid. The first few are 1, 6, 18, 40, 75, ... (OEIS A002411). The generating function for the pentagonal pyramidal numbers ...

A number which is simultaneously a pentagonal number P_n and a square number S_m. Such numbers exist when 1/2n(3n-1)=m^2. (1) Completing the square gives ...

A number which is simultaneously a pentagonal number P_n and triangular number T_m. Such numbers exist when 1/2n(3n-1)=1/2m(m+1). (1) Completing the square gives ...

The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...

Let p={a_1,a_2,...,a_n} be a permutation. Then i is a permutation ascent if a_i<a_(i+1). For example, the permutation {1,2,3,4} is composed of three ascents, namely {1,2}, ...

An n-persistent number is a positive integer k which contains the digits 0, 1, ..., 9 (i.e., is a pandigital number), and for which 2k, ..., nk also share this property. No ...

Pickover's sequence gives the starting positions in the decimal expansion of pi (ignoring the leading 3) in which the first n digits of e occur (counting the leading 2). So, ...

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 ...