🔶 TrianglesBase
Return the number of permutations of n letters, $n! = ∏(1, n)$, the factorial of $n$. (Nota: The notation is a shortcut. The use of '!' breaks Julia naming conventions, therefore use it only internally.)
🔶 TrianglesExamples
Recurrence for A132393, StirlingCycle numbers.
🔶 TrianglesUtils
Search the OEIS for a sequence. The file is saved in the 'data' directory in json format.