Av(1)
Generating Function
\(\displaystyle 1\)
Counting Sequence
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
Implicit Equation for the Generating Function
\(\displaystyle F \! \left(x \right)-1 = 0\)
Recurrence
\(\displaystyle a \! \left(0\right) = 1\)
\(\displaystyle a \! \left(n \right) = 0, \quad n \geq 1\)
\(\displaystyle a \! \left(n \right) = 0, \quad n \geq 1\)
Explicit Closed Form
\(\displaystyle \left\{\begin{array}{cc}1 & n =0 \\ 0 & \text{otherwise} \end{array}\right.\)
This specification was found using the strategy pack "Point Placements" and has 1 rules.
Found on January 21, 2022.Finding the specification took 0 seconds.
Copy 1 equations to clipboard:
\(\begin{align*}
F_{0}\! \left(x \right) &= 1\\
\end{align*}\)