Formulas presented for the calculation of [Summation of n over j=1] j[superscript k] (n, k [is a member of] N) do not have a closed form; they are in the form of recursive or complex formulas. Here an attempt is made to present a simple formula in which it is only necessary to compute the numerical coefficients in a recursive form, and the coefficients in turn follow a simple pattern (almost similar to Pascal's Triangle). Although the pattern for calculating numerical coefficients based on forming a table is easy, non-recursive formulas are presented to determine the numerical coefficients. (Contains 1 table.)