|
|
|
|
|
| Description |
A few important number sequences.
See the "On-Line Encyclopedia of Integer Sequences",
http://www.research.att.com/~njas/sequences/ .
|
|
| Synopsis |
|
|
|
| Documentation |
|
|
(-1)^k |
|
|
| A000142.
|
|
|
| A006882.
|
|
|
| A007318.
|
|
|
A given row of the Pascal triangle; equivalent to a sequence of binomial
numbers, but much more efficient. You can also left-fold over it.
pascalRow n == [ binomial n k | k<-[0..n] ]
|
|
|
|
| Catalan numbers
|
|
|
| Catalan numbers. OEIS:A000108.
|
|
|
Catalan's triangle. OEIS:A009766.
Note:
catalanTriangle n n == catalan n
catalanTriangle n k == countStandardYoungTableaux (toPartition [n,k])
|
|
| Stirling numbers
|
|
|
| Rows of (signed) Stirling numbers of the first kind. OEIS:A008275.
Coefficients of the polinomial (x-1)*(x-2)*...*(x-n+1).
This function uses the recursion formula.
|
|
|
| (Signed) Stirling numbers of the first kind. OEIS:A008275.
This function uses signedStirling1stArray, so it shouldn't be used
to compute many Stirling numbers.
|
|
|
| (Unsigned) Stirling numbers of the first kind. See signedStirling1st.
|
|
|
| Stirling numbers of the second kind. OEIS:A008277.
This function uses an explicit formula.
|
|
| Bernoulli numbers
|
|
|
| Bernoulli numbers. bernoulli 1 == -1%2 and bernoulli k == 0 for
k>2 and odd. This function uses the formula involving Stirling numbers
of the second kind. Numerators: A027641, denominators: A027642.
|
|
| Produced by Haddock version 2.6.1 |