An Algorithm for Sums of Integer Powers
From MaRDI portal
Publication:3346331
DOI10.2307/2689605zbMATH Open0553.05008OpenAlexW4241565872MaRDI QIDQ3346331FDOQ3346331
Authors: Clive Kelly
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2689605
Recommendations
Cited In (14)
- A note on Eulerian numbers and Toeplitz matrices
- Sums of Powers of Integers
- Title not available (Why is that?)
- Finding sum of powers on arithmetic progressions with application of Cauchy's equation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An alternative recursive formula for the sums of powers of integers
- Sums of powers of integers—A review
- A Simple Generalization of Nicomachus’ Identity
- Moessnerian theorems. How to prove them by simple graph theoretical inspection
- Title not available (Why is that?)
- Some Algorithms for the Sums of Integer Powers
- 68.37 To compute sum of integers raised to powers
This page was built for publication: An Algorithm for Sums of Integer Powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346331)