factorialk(n, k, exact=True)

This is the multifactorial of n skipping k values. For example,

factorialk(17, 4) = 17!!!! = 17 * 13 * 9 * 5 * 1

In particular, for any integer n , we have

factorialk(n, 1) = factorial(n)

factorialk(n, 2) = factorial2(n)

Parameters

n : int

Calculate multifactorial. If n < 0, the return value is 0.

k : int

Order of multifactorial.

exact : bool, optional

If exact is set to True, calculate the answer exactly using integer arithmetic.

Raises

NotImplementedError

Raises when exact is False

Returns

val : int

Multifactorial of n.

Multifactorial of n of order k, n(!!...!).

Examples

>>> from scipy.special import factorialk
... factorialk(5, 1, exact=True)
120

>>> factorialk(5, 3, exact=True)
10

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.special._basic.factorialk

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/special/_basic.py#2462
type: <class 'function'>
Commit: