Another Way of Counting N^N

DOI10.1137/0405028MaRDI QIDQ4018848zbMATH OpenOpenAlexFDO

Authors Arthur T. Benjamin, Fritz Juhnke

Publication date 16 January 1993

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0405028

zbMATH Keywords

combinatorial enumeration

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• A new way of counting \(n^ m\)
• An alternative recursive formula for the sums of powers of integers
• scientific article; zbMATH DE number 3520508
• A counting function for the sequence of perfect powers
• Counting the perfect powers
• A variant of inductive counting
• Counting multiderangements by excedances
• scientific article; zbMATH DE number 4035133

Cited in

(5)

• A combinatoric formula
• A new way of counting \(n^ m\)
• Proofs and applications for a combinatorial identity
• Trees, parking functions, and standard monomials of skeleton ideals
• scientific article; zbMATH DE number 2214417 (Why is no real title available?)

This page was built for publication: Another Way of Counting $N^N $

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018848)