Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:author |
gptkb:N._J._A._Sloane
|
| gptkbp:citation |
gptkb:A001047
gptkb:A000522 gptkb:A000629 gptkb:A002627 gptkb:R._P._Stanley,_Enumerative_Combinatorics,_Vol._1,_Cambridge,_1997,_p._23. A000110 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, 1973, p. 19. |
| gptkbp:describes |
Counts the number of ways to order n elements with ties allowed (preferential arrangements).
|
| gptkbp:first_terms |
1
13 3 541 75 102247563 1636791243 4683 47293 545835 7087261 |
| gptkbp:form |
a(n) = n! * sum_{k=0..n} 1/k!
a(n) = sum_{k=0..n} binomial(n,k) * k! |
| gptkbp:hasKeyword |
easy
nice nonn |
| https://www.w3.org/2000/01/rdf-schema#label |
A000670
|
| gptkbp:OEIS |
gptkb:A000670
https://oeis.org/A000670 |
| gptkbp:sequence |
Number of preferential arrangements of n labeled elements
|
| gptkbp:bfsParent |
gptkb:A008404
|
| gptkbp:bfsLayer |
7
|