Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Arithmetic functions; related numbers; inversion formulas (11A25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites work
- Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
- Extended Bernoulli and Eulerian numbers
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3363644 (Why is no real title available?)
- Simon Newcomb’s Problem
This page was built for publication: Specialized Möbius inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249577)