A196837 -id:A196837 - cp's OEIS frontend

A103438 Square array T(m,n) read by antidiagonals: Sum_{k=1..n} k^m.

0, 0, 1, 0, 1, 2, 0, 1, 3, 3, 0, 1, 5, 6, 4, 0, 1, 9, 14, 10, 5, 0, 1, 17, 36, 30, 15, 6, 0, 1, 33, 98, 100, 55, 21, 7, 0, 1, 65, 276, 354, 225, 91, 28, 8, 0, 1, 129, 794, 1300, 979, 441, 140, 36, 9, 0, 1, 257, 2316, 4890, 4425, 2275, 784, 204, 45, 10

Offset: 0

Ralf Stephan, Feb 11 2005

For the o.g.f.s of the column sequences for this array, see A196837 and the link given there. - Wolfdieter Lang, Oct 15 2011
T(m,n)/n is the m-th moment of the discrete uniform distribution on {1,2,...,n}. - Geoffrey Critzer, Dec 31 2018
T(1,n) divides T(m,n) for odd m. - Franz Vrabec, Dec 23 2020

			Square array begins:
  0, 1,  2,   3,    4,     5,     6,      7,      8,      9, ... A001477;
  0, 1,  3,   6,   10,    15,    21,     28,     36,     45, ... A000217;
  0, 1,  5,  14,   30,    55,    91,    140,    204,    285, ... A000330;
  0, 1,  9,  36,  100,   225,   441,    784,   1296,   2025, ... A000537;
  0, 1, 17,  98,  354,   979,  2275,   4676,   8772,  15333, ... A000538;
  0, 1, 33, 276, 1300,  4425, 12201,  29008,  61776, 120825, ... A000539;
  0, 1, 65, 794, 4890, 20515, 67171, 184820, 446964, 978405, ... A000540;
Antidiagonal triangle begins as:
  0;
  0, 1;
  0, 1,  2;
  0, 1,  3,  3;
  0, 1,  5,  6,  4;
  0, 1,  9, 14, 10,  5;
  0, 1, 17, 36, 30, 15, 6;

J. Faulhaber, Academia Algebrae, Darinnen die miraculosische inventiones zu den höchsten Cossen weiters continuirt und profitirt werden, Augspurg, bey Johann Ulrich Schönigs, 1631.

G. C. Greubel, Antidiagonals n = 0..50, flattened
José L. Cereceda, Sums of powers of integers and hyperharmonic numbers, arXiv:2005.03407 [math.NT], 2020.
T. A. Gulliver, Divisibility of sums of powers of odd integers, Int. Math. For. 5 (2010) 3059-3066.
T. A. Gulliver, Sums of Powers of Integers Divisible by Three, Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 38, pp. 1895-1901. - From _N. J. A. Sloane_, Dec 22 2012
V. J. W. Guo and J. Zeng, A q-analogue of Faulhaber's formula for sums of powers, arXiv:math/0501441 [math.CO], 2005.
H. Helfgott and I. M. Gessel, Enumeration of tilings of diamonds and hexagons with defects, arXiv:math/9810143 [math.CO], 1998.
T. Kim, q-analogues of the sums of powers of consecutive integers, arXiv:math/0502113 [math.NT], 2005.
D. E. Knuth, Johann Faulhaber and sums of powers, Math. Comp. 61 (1993), no. 203, 277-294.
Eric Weisstein's World of Mathematics, Discrete Uniform Distribution.
Wikipedia, Faulhaber's formula

Rows include A000027, A000217, A000330, A000537, A000538, A000539, A000540, A000541, A000542, A007487, A023002.
Columns include A000051, A001550, A001551, A001552, A001553, A001554, A001555, A001556, A001557.
Diagonals include A076015 and A031971.
Antidiagonal sums are in A103439.
Antidiagonals are the rows of triangle A192001.

T:= func< n,k | n eq 0 select k else (&+[j^n: j in [0..k]]) >;
[T(n-k,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Dec 22 2021

seq(print(seq(Zeta(0,-k,1)-Zeta(0,-k,n+1),n=0..9)),k=0..6);
# (Produces the square array from the example.) Peter Luschny, Nov 16 2008
# alternative
A103438 := proc(m,n)
    (bernoulli(m+1,n+1)-bernoulli(m+1))/(m+1) ;
    if m = 0 then
        %-1 ;
    else
        % ;
    end if;
end proc: # R. J. Mathar, May 10 2013
# simpler:
A103438 := proc(m,n)
    (bernoulli(m+1,n+1)-bernoulli(m+1,1))/(m+1) ;
end proc: # Peter Luschny, Mar 20 2024

T[m_, n_]:= HarmonicNumber[m, -n]; Flatten[Table[T[m-n, n], {m, 0, 11}, {n, m, 0, -1}]] (* Jean-François Alcover, May 11 2012 *)

PARI
```
T(m,n)=sum(k=0,n,k^m)
```

from itertools import count, islice
from math import comb
from fractions import Fraction
from sympy import bernoulli
def A103438_T(m,n): return sum(k**m for k in range(1,n+1)) if n<=m else int(sum(comb(m+1,i)*(bernoulli(i) if i!=1 else Fraction(1,2))*n**(m-i+1) for i in range(m+1))/(m+1))
def A103438_gen(): # generator of terms
    for m in count(0):
        for n in range(m+1):
            yield A103438_T(m-n,n)
A103438_list = list(islice(A103438_gen(),100)) # Chai Wah Wu, Oct 23 2024

def T(n,k): return (bernoulli_polynomial(k+1, n+1) - bernoulli_polynomial(1, n+1)) /(n+1)
flatten([[T(n-k,k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Dec 22 2021

E.g.f.: e^x*(e^(x*y)-1)/(e^x-1).
T(m, n) = Zeta(-n, 1) - Zeta(-n, m + 1), for m >= 0 and n >= 0, where Zeta(z, v) is the Hurwitz zeta function. - Peter Luschny, Nov 16 2008
T(m, n) = HarmonicNumber(m, -n). - Jean-François Alcover, May 11 2012
T(m, n) = (Bernoulli(m + 1, n + 1) - Bernoulli(m + 1, 1)) / (m + 1). - Peter Luschny, Mar 20 2024
T(m, n) = Sum_{k=0...m-n} B(k)*(-1)^k*binomial(m-n,k)*n^(m-n-k+1)/(m-n-k+1), where B(k) = Bernoulli number A027641(k) / A027642(k). - Robert B Fowler, Aug 20 2024
T(m, n) = Sum_{i=1..n} J_m(i)*floor(n/i), where J_m is the m-th Jordan totient function. - Ridouane Oudra, Jul 19 2025

A060096 Numerator of coefficients of Euler polynomials (rising powers).

Original entry on oeis.org

1, -1, 1, 0, -1, 1, 1, 0, -3, 1, 0, 1, 0, -2, 1, -1, 0, 5, 0, -5, 1, 0, -3, 0, 5, 0, -3, 1, 17, 0, -21, 0, 35, 0, -7, 1, 0, 17, 0, -28, 0, 14, 0, -4, 1, -31, 0, 153, 0, -63, 0, 21, 0, -9, 1, 0, -155, 0, 255, 0, -126, 0, 30, 0, -5, 1, 691, 0, -1705, 0, 2805, 0, -231, 0, 165, 0, -11, 1, 0, 2073, 0, -3410, 0, 1683, 0, -396

Offset: 0

Wolfdieter Lang, Mar 29 2001

From S. Roman, The Umbral Calculus (see the reference in A048854), p. 101, (4.2.10) (corrected): E(n,x)= sum(sum(binomial(n,m)*((-1/2)^j)*j!*S2(n-m,j),j=0..k)*x^m,m=0..n), with S2(n,m)=A008277(n,m) and S2(n,0)=1 if n=0 else 0 (Stirling2).
From Wolfdieter Lang, Oct 31 2011: (Start)
This is the Sheffer triangle (2/(exp(x)+1),x) (which would be called in the above mentioned S. Roman reference Appell for (exp(t)+1)/2) (see p. 27).
  The e.g.f. for the row sums is 2/(1+exp(-x)). The row sums look like A198631(n)/A006519(n+1), n>=0.
  The e.g.f. for the alternating row sums is 2/(exp(x)*(exp(x)+1)). These sums look like (-1)^n*A143074(n)/ A006519(n+1).
  The e.g.f. for the a-sequence of this Sheffer array is 1. The z-sequence has e.g.f. (1-exp(x))/(2*x). This z-sequence is -1/(2*A000027(n))=-1/(2*(n+1)) (see the link under A006232 for the definition of a- and z-sequences). This leads to the recurrences given below.
The alternating power sums for the first n positive integers are given by sum((-1)^(n-j)*j^k,j=1..n) = (E(k, x=n+1)+(-1)^n*E(k, x=0))/2, k>=1, n>=1,with the row polynomials E(n, x)(see the Abramowitz-Stegun reference, p. 804, 23.1.4, and an addendum in the W. Lang link under A196837).
(End)

			n\m  0    1    2    3    4    5    6    7  8  ...
0:   1
1:  -1    1
2:   0   -1    1
3:   1    0   -3    1
4:   0    1    0   -2    1
5:  -1    0    5    0   -5    1
6:   0   -3    0    5    0   -3    1
7:  17    0  -21    0   35    0   -7    1
8:   0   17    0  -28    0   14    0   -4  1
...
The rational triangle a(n,m)/A060097(n,m) starts
n\m  0    1    2    3    4    5    6    7  8  ...
0:   1
1: -1/2   1
2:   0   -1    1
3:  1/4   0  -3/2   1
4:   0    1    0   -2    1
5: -1/2   0   5/2   0  -5/2   1
6:   0   -3    0    5    0   -3    1
7: 17/8   0 -21/2   0  35/4   0  -7/2   1
8:   0   17    0  -28    0   14    0   -4  1
...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 809.
Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 20, equations 20:4:1 - 20:4:8 at pages 177-178.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

Cf. A060097.

A060096 := proc(n,m) coeff(euler(n,x),x,m) ; numer(%) ;end proc:
seq(seq(A060096(n,m),m=0..n),n=0..12) ; # R. J. Mathar, Dec 21 2010

Numerator[Flatten[Table[CoefficientList[EulerE[n, x], x], {n, 0, 12}]]] (* Jean-François Alcover, Apr 29 2011 *)

E(n, x)= sum((a(n, m)/b(n, m))*x^m, m=0..n), denominators b(n, m)= A060097(n, m).
From Wolfdieter Lang, Oct 31 2011: (Start)
E.g.f. for E(n, x) is 2*exp(x*z)/(exp(z)+1).
E.g.f. of column no. m, m>=0, is 2*x^{m+1}/(m!*(exp(x)+1)).
Recurrences for E(n,m):=a(n,m)/A060097(n,m) from the Sheffer a-and z-sequence:
E(n,m)=(n/m)*E(n-1,m-1), n>=1,m>=1.
E(n,0)=-n*sum(E(n-1,j)/(2*(j+1)),j=0..n-1), n>=1, E(0,0)=1.
(see the Sheffer comments above).
(End)
E(n,m) = binomial(n,m)*sum(((-1)^j)*j!*S2(n-m,j)/2^j ,j=0..n-m), 0<=m<=n, with S2 given by A008277. From S. Roman, The umbral calculus, reference under A048854, eq. (4.2.10), p. 101, with a=1, and a misprint corrected: replace 1/k! by binomial(n,k) (also in the two preceding formulas). - Wolfdieter Lang, Nov 03 2011
The first (m=0) column of the rational triangle is conjectured to be E(n,0) = ((-1)^n)*A198631(n) / A006519(n+1). See also the first column shown in A209308 (different signs). - Wolfdieter Lang, Jun 15 2015

Table rewritten by Wolfdieter Lang, Oct 31 2011

A001553 a(n) = 1^n + 2^n + ... + 6^n.

Original entry on oeis.org

6, 21, 91, 441, 2275, 12201, 67171, 376761, 2142595, 12313161, 71340451, 415998681, 2438235715, 14350108521, 84740914531, 501790686201, 2978035877635, 17706908038281, 105443761093411, 628709267031321, 3752628871164355, 22418196307542441, 134023513204581091

Offset: 0

N. J. A. Sloane

For the o.g.f.s of such sequences see the W. Lang link under A196837. The e.g.f.s are trivial. - Wolfdieter Lang, Oct 14 2011

a(n) is divisible by 7 iff n is not divisible by 6 (see De Koninck & Mercier reference). Example: a(5)= 12201 = 7 * 1743 and a(6) = 67171 = 9595 * 7 + 6. - Bernard Schott, Mar 06 2020

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 813.
J.-M. De Koninck and A. Mercier, 1001 Problèmes en Théorie Classique des Nombres, Problème 289 pp. 45, 194, Ellipses, Paris, (2004).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 366
Index entries for linear recurrences with constant coefficients, signature (21, -175, 735, -1624, 1764, -720).

Column 6 of array A103438, A001552.

Table[Total[Range[6]^n], {n, 0, 40}] (* T. D. Noe, Oct 10 2011 *)

a(n) = Sum_{k=1..6} k^n.
From Wolfdieter Lang, Oct 10 2011: (Start)
E.g.f.: (1-exp(6*x))/(exp(-x)-1) = Sum_{j=1..6} exp(j*x) (trivial).
O.g.f.: (2 - 7*x)*(3 - 42*x + 203*x^2 - 392*x^3 + 252*x^4)/Product_{j=1..6} (1 - j*x).
From the Laplace transformation of the e.g.f. (with argument 1/p, and multiplied with 1/p), which yields the partial fraction decomposition of the given o.g.f., namely Sum_{j=1..6} 1/(1 - j*x).
(End)

More terms from Jon E. Schoenfield, Mar 24 2010

A162298 Faulhaber's triangle: triangle T(k,y) read by rows, giving numerator of the coefficient [m^y] of the polynomial Sum_{x=1..m} x^(k-1).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 0, 1, 1, 1, -1, 0, 1, 1, 1, 0, -1, 0, 5, 1, 1, 1, 0, -1, 0, 1, 1, 1, 0, 1, 0, -7, 0, 7, 1, 1, -1, 0, 2, 0, -7, 0, 2, 1, 1, 0, -3, 0, 1, 0, -7, 0, 3, 1, 1, 5, 0, -1, 0, 1, 0, -1, 0, 5, 1, 1, 0, 5, 0, -11, 0, 11, 0, -11, 0, 11, 1, 1, -691, 0, 5, 0, -33, 0, 22, 0, -11, 0, 1, 1, 1, 0, -691, 0, 65, 0, -143, 0, 143, 0, -143, 0, 13, 1, 1

Offset: 0

Juri-Stepan Gerasimov, Jun 30 2009 and Jul 02 2009

There are many versions of Faulhaber's triangle: search the OEIS for his name. For example, A220962/A220963 is essentially the same as this triangle, except for an initial column of 0's. - N. J. A. Sloane, Jan 28 2017
Named after the German mathematician Johann Faulhaber (1580-1653). - Amiram Eldar, Jun 13 2021
From Wolfdieter Lang, Oct 23 2011 (Start):
The sums of the k-th power of each of the first n positive integers, sum(j^k,j=1..n), k>=0, n>=1, abbreviated usually as Sigma n^k, can be written as Sigma n^k = sum(r(k,m)*n^m,m=1..k+1), with the rational number triangle r(n,m)=a(n,m)/A162299(k+1,m). See, e.g., the Graham et al. reference, eq. (6.78), p. 269, where Sigma n^k is S_k(n+1) - delta(k,0), with delta(k,0)=1 if k=0 and 0 else. The formula for r(n,m) given below can be adapted from this reference, and it is found in the given form (for k>0) in the Remmert reference, p. 175.
For sums of powers of integers see the array A103438 with further references and links.
(End)

			The first few polynomials:
    m;
   m/2  + m^2/2;
   m/6  + m^2/2 + m^3/3;
    0   + m^2/4 + m^3/2 + m^4/4;
  -m/30 +   0   + m^3/3 + m^4/2 + m^5/5;
  ...
Initial rows of Faulhaber's triangle of fractions H(n, k) (n >= 0, 1 <= k <= n+1):
    1;
   1/2,  1/2;
   1/6,  1/2,  1/3;
    0,   1/4,  1/2,  1/4;
  -1/30,  0,   1/3,  1/2,  1/5;
    0,  -1/12,  0,   5/12, 1/2,  1/6;
   1/42,  0,  -1/6,   0,   1/2,  1/2,  1/7;
    0,   1/12,  0,  -7/24,  0,   7/12, 1/2,  1/8;
  -1/30,  0,   2/9,   0,  -7/15,  0,   2/3,  1/2,  1/9;
  ...

Alois P. Heinz, Rows n = 0..140, flattened
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1991 (Seventh printing).Second ed. 1994.
R. Remmert, Funktionentheorie I, Zweite Auflage, Springer-Verlag, 1989. English version: Classical topics in complex function theory, Springer, 1998.
Mohammad Torabi-Dashti, Faulhaber's Triangle, College Math. J., Vol. 42, No. 2 (2011), pp. 96-97.
Mohammad Torabi-Dashti, Faulhaber’s Triangle. [Annotated scanned copy of preprint]
Eric Weisstein's MathWorld, Power Sum.

Cf. A000367, A162299 (denominators), A103438, A196837.

A001554 a(n) = 1^n + 2^n + ... + 7^n.

Original entry on oeis.org

7, 28, 140, 784, 4676, 29008, 184820, 1200304, 7907396, 52666768, 353815700, 2393325424, 16279522916, 111239118928, 762963987380, 5249352196144, 36210966447236, 250337422025488, 1733857359003860, 12027604452404464, 83544895168776356, 580964060390826448

Offset: 0

N. J. A. Sloane

Conjectures for o.g.f.s for this type of sequences appear in the PhD thesis by Simon Plouffe. See A001552 for the reference. These conjectures are proved in a link given in A196837. - Wolfdieter Lang, Oct 15 2011

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 813.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 367
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Index entries for linear recurrences with constant coefficients, signature (28, -322, 1960, -6769, 13132, -13068, 5040).

Column 7 of array A103438. A196837.

[1+2^n+3^n+4^n+5^n+6^n+7^n : n in [0..30]]; // Wesley Ivan Hurt, Jul 15 2014

A001554:=n->add(i^n, i=1..7): seq(A001554(n), n=0..30); # Wesley Ivan Hurt, Jul 15 2014

Mathematica
```
Table[Total[Range[7]^n], {n, 0, 20}]
```

From Wolfdieter Lang, Oct 15 2011: (Start)
E.g.f.: (1-exp(7*x))/(exp(-x)-1) = Sum_{j=1..7} exp(j*x) (trivial).
O.g.f.: (7 - 168*x + 1610*x^2 - 7840*x^3 + 20307*x^4 - 26264*x^5 + 13068*x^6)/Product_{j=1..7} (1 - j*x). From the e.g.f. via Laplace transformation. See the proof in a link under A196837. (End)

More terms from Jon E. Schoenfield, Mar 24 2010

A196847 Coefficient table of numerator polynomials of the ordinary generating function for the alternating power sums for the numbers 1,2,...,2*n.

Original entry on oeis.org

1, 1, -5, 7, 1, -14, 73, -168, 148, 1, -27, 298, -1719, 5473, -9162, 6396, 1, -44, 830, -8756, 56453, -227744, 562060, -778800, 468576, 1, -65, 1865, -31070, 332463, -2385305, 11612795, -37875240, 79269676, -96420480, 52148160, 1, -90, 3647, -87900, 140202

Offset: 1

Wolfdieter Lang, Oct 27 2011

The row length sequence of this array is A005408(n-1), n >= 1: 1,3,5,7,...
This is the array for the numerator polynomials of the o.g.f. of alternating power sums of the first 2*n positive integers.
The corresponding array for the first 2*n+1 positive integers is found in A196848.
The obvious e.g.f. of a(k,2*n) := Sum_{j=1..2*n} (-1)^j * j^k is ge(n,x) := Sum_{k>=0} a(k,2*n)*(x^k)/k! = Sum_{j=1..2*n} (-1)^j * exp(j*x) = exp(x)*(exp(2*n*x) - 1)/(exp(x) + 1).
Via Laplace transformation (see the link under A196837, addendum) one finds the corresponding o.g.f.: Ge(n,x) = n*x*Pe(n,x)/Product_{j=1..2*n} (1 - j*x) with the numerator polynomial Pe(n,x) = Sum_{m=0..2*(n-1)} a(n,m)*x^m.

			n\m 0   1   2     3     4       5      6       7      8
1:  1
2:  1  -5   7
3:  1 -14  73  -168   148
4:  1 -27 298 -1719  5473   -9162   6396
5:  1 -44 830 -8756 56453 -227744 562060 -778800 468576
...
The o.g.f. for the sequence a(k,4) := -(1^k - 2^k + 3^k -4^k) = 2*A053154(k), k>=0, (n=2) is Ge(2,x) = 2*x*(1-5*x+7*x^2)/Product_{j=1..4} (1 - j*x).
a(3,2) = (S_{1,2}(4,2) + S_{3,4}(4,2) + S_{5,6}(4,2))/3 = (A196845(4,2) + A196846(4,2) + |s(5,3)|)/3 = (119+65+35)/3 = 73. Here S_{5,6}(4,2) = a_2(1,2,3,4) = |s(5,3)|, with the Stirling numbers of the first kind s(n,m) = A048994(n,m) was used.

Cf. A196848, A196837.

a(n,m) = [x^m](Ge(n,x)*Product_{j=1..2*n} (1 - j*x/(n*x))), with the o.g.f. Ge(n,x) of the sequence a(k,2*n) := Sum_{j=1..2*n} (-1)^j * j^k. See a comment above.

a(n,m) = (1/n)*(-1)^m*Sum_{i=1..n} S_{2*i-1,2*i}(2*(n-1),m), n >= 1, with the (i,j)-family of number triangles S_{i,j}(n,k) defined in a comment to A196845.

A001555 a(n) = 1^n + 2^n + ... + 8^n.

Original entry on oeis.org

8, 36, 204, 1296, 8772, 61776, 446964, 3297456, 24684612, 186884496, 1427557524, 10983260016, 84998999652, 660994932816, 5161010498484, 40433724284976, 317685943157892, 2502137235710736, 19748255868485844, 156142792528260336, 1236466399775623332

Offset: 0

N. J. A. Sloane

Conjectures for o.g.f.s for this type of sequence appear in the PhD thesis by Simon Plouffe. See A001552 for the reference. These conjectures are proved in a link given in A196837. [Wolfdieter Lang, Oct 15 2011]

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 813.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe and Robert Israel, Table of n, a(n) for n = 0..1000 (n = 0..200 from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 368
Index entries for linear recurrences with constant coefficients, signature (36, -546, 4536, -22449, 67284, -118124, 109584, -40320).

Column 8 of array A103438.

Cf. A001018, A001552, A001554, A196837.

seq(add(j^n,j=1..8), n=0..20); # Robert Israel, Aug 23 2015

Table[Total[Range[8]^n], {n, 0, 20}] (* T. D. Noe, Aug 09 2012 *)

first(m)=vector(m,n,n--;sum(i=1,8,i^n)) \\ Anders Hellström, Aug 23 2015

From Wolfdieter Lang, Oct 15 2011 (Start)
E.g.f.: (1-exp(8*x))/(exp(-x)-1) = Sum_{j=1..8} exp(j*x) (trivial).
O.g.f.: 4*(2-9*x)*(1-27*x+288*x^2-1539*x^3+4299*x^4-5886*x^5+3044*x^6) / Product_{j=1..8} (1-j*x). From the e.g.f. via Laplace transformation. See the proof in a link under A196837. (End)
a(n) = A001554(n) + A001018(n). - Michel Marcus, Jul 26 2013

More terms from Jon E. Schoenfield, Mar 24 2010

A001556 a(n) = 1^n + 2^n + ... + 9^n.

Original entry on oeis.org

9, 45, 285, 2025, 15333, 120825, 978405, 8080425, 67731333, 574304985, 4914341925, 42364319625, 367428536133, 3202860761145, 28037802953445, 246324856379625, 2170706132009733, 19179318935377305, 169842891165484965, 1506994510201252425

Offset: 0

N. J. A. Sloane

nonn

Conjectures for o.g.f.s for this type of sequences appear in the PhD thesis by Simon Plouffe. See A001552 for the reference. These conjectures are proved in the link given in A196837. - Wolfdieter Lang, Oct 15 2011

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 813.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 369
Index entries for linear recurrences with constant coefficients, signature (45, -870, 9450, -63273, 269325, -723680, 1172700, -1026576, 362880).

Column 9 of array A103438. A196837.

Table[Total[Range[9]^n], {n, 0, 20}] (* T. D. Noe, Aug 09 2012 *)

a(n) = sum_{j=1..9} j^n, n>=0.
From Wolfdieter Lang, Oct 15 2011: (Start)
E.g.f.: (1-exp(9*x))/(exp(-x)-1) = sum(exp(j*x),j=1..9) (trivial).
O.g.f.: (9 - 360*x + 6090*x^2 - 56700*x^3 + 316365*x^4 - 1077300*x^5 + 2171040*x^6 - 2345400*x^7 + 1026576*x^8)/product_{j=1..9} (1-j*x).
From the e.g.f. via Laplace transformation. See the proof in a link under A196837.
(End)
a(n) = A001555(n) + A001019(n). - Michel Marcus, Jul 26 2013

More terms from Jon E. Schoenfield, Mar 24 2010

A001557 a(n) = 1^n + 2^n + ... + 10^n.

Original entry on oeis.org

10, 55, 385, 3025, 25333, 220825, 1978405, 18080425, 167731333, 1574304985, 14914341925, 142364319625, 1367428536133, 13202860761145, 128037802953445, 1246324856379625, 12170706132009733, 119179318935377305, 1169842891165484965, 11506994510201252425

Offset: 0

N. J. A. Sloane

Conjectures for o.g.f.s for this type of sequences appear in the PhD thesis by Simon Plouffe. See A001552 for the reference. These conjectures are proved in the link given in A196837. - Wolfdieter Lang, Oct 15 2011

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 813.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 370.
Index entries for linear recurrences with constant coefficients, signature (55, -1320, 18150, -157773, 902055, -3416930, 8409500, -12753576, 10628640, -3628800).

Column 10 of array A103438. Cf. A196837.

Table[Total[Range[10]^n], {n, 0, 20}] (* T. D. Noe, Aug 09 2012 *)

def A001557(n): return sum(i**n for i in range(1,11)) # Chai Wah Wu, Oct 24 2024

a(n) = Sum_{j=1..10} j^n, n >= 0.
E.g.f.: exp(x) + exp(2*x) + exp(3*x) + exp(4*x) + exp(5*x) + exp(6*x) + exp(7*x) + exp(8*x) + exp(9*x) + exp(10*x). - Vladeta Jovovic, May 08 2002
From Wolfdieter Lang, Oct 15 2011: (Start)
O.g.f.: (2 - 11*x) *(5 - 220*x + 4070*x^2 - 41140*x^3 + 247049*x^4 - 896368*x^5 + 1903836*x^6 - 2143152*x^7 + 966240*x^8)/Product_{j=1..10} (1 - j*x).
From the e.g.f. via Laplace transformation. See the proof in a link under A196837.
(End)
a(n) = A001556(n) + A011557(n). - Michel Marcus, Jul 26 2013

More terms from Jon E. Schoenfield, Mar 24 2010

A196848 Coefficient array of numerator polynomials of the ordinary generating functions for the alternating sums of powers for the numbers 1,2,...,2*n+1.

Original entry on oeis.org

1, 1, -4, 5, 1, -12, 55, -114, 94, 1, -24, 238, -1248, 3661, -5736, 3828, 1, -40, 690, -6700, 40053, -151060, 351800, -465000, 270576, 1, -60, 1595, -24720, 247203, -1665900, 7660565, -23745720, 47560876, -55805520, 29400480, 1, -84, 3185, -72030, 1081353, -11344872, 85234175, -461800710, 1790256286, -4843901664, 8693117160, -9320129280, 4546558080

Offset: 0

Wolfdieter Lang, Oct 27 2011

The row length sequence of this array is A005408(n), n>=0: 1,3,5,7,...
This is the array for the numerator polynomials of the o.g.f. of alternating sums of powers of the first 2*n+1 positive integers.
The corresponding array for the first 2*n positive integers is found in A196847.
The obvious e.g.f. of a(k,2*n+1) := Sum_{j=1..2*n+1} (-1)^(j+1) * j^k is go(n,x) := Sum_{k>=0} a(k,2*n+1)*(x^k)/k! = Sum_{j=1..2*n+1} (-1)^(j+1) * exp(j*x) = exp(x)*(exp((2*n+1)*x) + 1)/(exp(x) + 1).
Via Laplace transformation (see the link under A196837, addendum) one finds the corresponding o.g.f.: Go(n,x) = Po(n,x)/Product_{j=1..2*n+1} (1 - j*x) with the numerator polynomial Po(n,x) = Sum_{m=0..2*n} a(n,m)*x^m.

			n\m 0   1   2     3     4       5      6       7       8
0:  1
1:  1  -4   5
2:  1 -12  55  -114    94
3:  1 -24 238 -1248  3661   -5736   3828
4:  1 -40 690 -6700 40053 -151060 351800 -465000, 270576
...
The o.g.f. for the sequence a(k,5) := (1^k - 2^k + 3^k - 4^k + 5^k) = A198628(k), k >= 0, (n=2) is Go(2,x) = (1 - 12*x + 55*x^2 - 114*x^3 + 94*x^4)/Product_{j=1..5} (1-j*x).
a(3,2) = S_{1,2}(5,1) + S_{3,4}(5,1) + S_{5,6}(5,1) + |s(7,5)| = A196845(5,1) + A196846(5,1) + 17 + |s(7,5)| = 25+21+17+175 = 238. Here S_{5,6}(5,1) = 1+2+3+4+7 = 17 was used.

Cf. A196847, A196837.

a(n,m) = [x^m](Go(n,x)*Product_{j=1..2*n+1} (1-j*x)), with the o.g.f. Go(n,x) of the sequence a(k,2*n+1) := Sum_{j=1..2*n+1} (-1)^(j+1) * j^k. See a comment above.

a(n,0) = 1, n >= 0, and a(n,m) = (-1)^m*((Sum_{i=1..n} S_{2*i-1,2*i}(2*(n-1),m)) + |s(2*n+1,2n+1-m)|), n >= 0, m = 1..2*n, with the (i,j)-family of number triangles S_{i,j}(n,k) defined in a comment on A196845, and the Stirling numbers of the first kind s(n,m) = A048994(n,m).

cp's OEIS Frontend

A103438 Square array T(m,n) read by antidiagonals: Sum_{k=1..n} k^m.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

SageMath

Formula

A060096 Numerator of coefficients of Euler polynomials (rising powers).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A001553 a(n) = 1^n + 2^n + ... + 6^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A162298 Faulhaber's triangle: triangle T(k,y) read by rows, giving numerator of the coefficient [m^y] of the polynomial Sum_{x=1..m} x^(k-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A001554 a(n) = 1^n + 2^n + ... + 7^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A196847 Coefficient table of numerator polynomials of the ordinary generating function for the alternating power sums for the numbers 1,2,...,2*n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A001555 a(n) = 1^n + 2^n + ... + 8^n.