
AbstractIn this paper we calculate which prime powers ps divide Δn, m = g.c.d.{k! S(n, k)|m ≤ k ≤ n} for s < p. Here S(n, k) is a Stirling number of the second kind.
Algebra and Number Theory, Fibonacci and Lucas numbers and polynomials and generalizations, Multiplicative structure; Euclidean algorithm; greatest common divisors, Combinatorial identities, bijective combinatorics
Algebra and Number Theory, Fibonacci and Lucas numbers and polynomials and generalizations, Multiplicative structure; Euclidean algorithm; greatest common divisors, Combinatorial identities, bijective combinatorics
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 21 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
