Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:author |
gptkb:N._J._A._Sloane
|
| gptkbp:citation |
gptkb:A000295
gptkb:A000670 gptkb:A008292 |
| gptkbp:describes |
Triangle of Eulerian numbers; T(n, k) = number of permutations of 1..n with exactly k ascents.
|
| gptkbp:first_terms |
1, 1, 1, 1, 4, 1, 1, 11, 11, 1, 1, 26, 66, 26, 1, 1, 57, 302, 302, 57, 1
|
| gptkbp:hasKeyword |
easy
nonn tabl |
| https://www.w3.org/2000/01/rdf-schema#label |
A008404
|
| gptkbp:OEIS |
gptkb:A008404
https://oeis.org/A008404 |
| gptkbp:relatedTo |
gptkb:Eulerian_numbers
|
| gptkbp:row_sums |
n! (factorial)
|
| gptkbp:sequence |
gptkb:train
|
| gptkbp:bfsParent |
gptkb:Costas_array
|
| gptkbp:bfsLayer |
6
|