A022522 -id:A022522 - cp's OEIS frontend

A069473 First differences of (n+1)^6-n^6 (A022522).

62, 602, 2702, 8162, 19502, 39962, 73502, 124802, 199262, 303002, 442862, 626402, 861902, 1158362, 1525502, 1973762, 2514302, 3159002, 3920462, 4812002, 5847662, 7042202, 8411102, 9970562, 11737502, 13729562, 15965102, 18463202

Offset: 0

Eli McGowan (ejmcgowa(AT)mail.lakeheadu.ca), Mar 26 2002

Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A001014, A022522, A069474, A069475, A069476, A068236.

[30*n^4+120*n^3+210*n^2+180*n+62: n in [0..30]]; // Bruno Berselli, Feb 25 2015

Differences[Table[(n + 1)^6 - n^6, {n, 0, 30}]] (* Harvey P. Dale, Dec 27 2011 *)

a(n) = 30*n^4 + 120*n^3 + 210*n^2 + 180*n + 62.

G.f.: 2*(31 + 146*x + 156*x^2 + 26*x^3 + x^4)/(1 - x)^5. [Bruno Berselli, Feb 25 2015]

Offset changed from 1 to 0 and added a(0)=62 by Bruno Berselli, Feb 25 2015

A001014 Sixth powers: a(n) = n^6.

Original entry on oeis.org

0, 1, 64, 729, 4096, 15625, 46656, 117649, 262144, 531441, 1000000, 1771561, 2985984, 4826809, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 85766121, 113379904, 148035889, 191102976, 244140625, 308915776, 387420489, 481890304

Offset: 0

N. J. A. Sloane

Numbers both square and cubic. - Patrick De Geest
Totally multiplicative sequence with a(p) = p^6 for prime p. - Jaroslav Krizek, Nov 01 2009
Numbers n for which the order of the torsion subgroup of the elliptic curve y^2 = x^3 + n is t = 6, cf. Gebel link. - Artur Jasinski, Jun 30 2010
Note that Sum_{n>=1} 1/a(n) = Pi^6 / 945. - Mohammad K. Azarian, Nov 01 2011
The binomial transform yields A056468. The inverse binomial transform yields the (finite) 0, 1, 62, 540, ..., 720, the 6th row in A019538 and A131689. - R. J. Mathar, Jan 16 2013
For n > 0, a(n) is the largest number k such that k + n^3 divides k^2 + n^3. - Derek Orr, Oct 01 2014

			The 6th powers of the first few integers are: 0^6 = 0 = a(0), 1^6 = 1 = a(1), 2^6 = 64 = a(2), 3^6 = 9^3 = 729 = a(3), 4^6 = 2^12 = 4096 = a(4), 5^6 = 25^3 = 15625 = a(5), etc.

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 255; 2nd. ed., p. 269. Worpitzky's identity, eq. (6.37).
Granino A. Korn and Theresa M.Korn, Mathematical Handbook for Scientists and Engineers, McGraw-Hill Book Company, New York (1968), p. 982.
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).

Franklin T. Adams-Watters, Table of n, a(n) for n = 0..500
Henry Bottomley, Illustration of initial terms
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
Richard J. Mathar, Construction of Bhaskara pairs, arXiv:1703.01677 [math.NT], 2017.
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.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Index entries for linear recurrences with constant coefficients, signature (7, -21, 35, -35, 21, -7, 1).

Subsequence of A201217.
Cf. A000540 (partial sums), A022522 (first differences), A008292.
Intersection of A000290 (squares) and A000578 (cubes).
Cf. A002604 (n^6+1), A123866 (n^6-1), A013664 (zeta(6)), A275703 (eta(6)).
Cf. A003358 - A003368 (sums of 2, ..., 12 positive sixth powers).

a001014 n = a001014_list !! n
a001014_list = map (^ 6) [0..] -- Reinhard Zumkeller, Dec 04 2011

Table[n^6, {n, 0, 40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)

A001014(n):=n^6$
makelist(A001014(n),n,0,30); /* Martin Ettl, Nov 05 2012 */

A001014(n)=n^6 \\ Charles R Greathouse IV, Sep 24 2015

A001014 = lambda n: n**6 # M. F. Hasler, Jul 03 2025

a(n) = A123866(n) + 1 = A002604(n) - 1.
G.f.: -x*(1+x)*(x^4+56*x^3+246*x^2+56*x+1) / (x-1)^7. - Simon Plouffe in his 1992 dissertation
Multiplicative with a(p^e) = p^(6e). - David W. Wilson, Aug 01 2001
E.g.f.: (x + 31x^2 + 90x^3 + 65x^4 + 15x^5 + x^6)*exp(x).  Generally, the e.g.f. for n^m is Sum_{k=1..m} A008277(m,k)*x^k*exp(x). - Geoffrey Critzer, Aug 25 2013
From Ant King, Sep 23 2013: (Start)
Signature {7, -21, 35, -35, 21, -7, 1}.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) + 720. (End)
a(n) == 1 (mod 7) if gcd(n, 7) = 1, otherwise a(n) == 0 (mod 7). See A109720. - Jake Lawrence, May 28 2016
From Ilya Gutkovskiy, Jul 06 2016: (Start)
Dirichlet g.f.: zeta(s-6).
Sum_{n>=1} 1/a(n) = Pi^6/945 = A013664. (End)
a(n) = Sum_{k=1..6} Eulerian(6, k)*binomial(n+6-k, 6), with Eulerian(6, k) = A008292(6, k) (the numbers are 1, 57, 302, 302, 57, 1) for n >= 0. Worpitzki's identity for powers of 6. See. e.g., Graham et al., eq. (6, 37) (using A173018, the row reversed version of A123125). - Wolfdieter Lang, Jul 17 2019
Sum_{n>=1} (-1)^(n+1)/a(n) = 31*zeta(6)/32 = 31*Pi^6/30240 (A275703). - Amiram Eldar, Oct 08 2020
From Amiram Eldar, Jan 20 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = (cosh(Pi)-cos(sqrt(3)*Pi))*sinh(Pi)/(2*Pi^3).
Product_{n>=2} (1 - 1/a(n)) = cosh(sqrt(3)*Pi/2)^2/(6*Pi^2). (End)

Comments from 2010 - 2011 edited by M. F. Hasler, Jul 05 2024

A047969 Square array of nexus numbers a(n,k) = (n+1)^(k+1) - n^(k+1) (n >= 0, k >= 0) read by upwards antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 5, 7, 1, 1, 7, 19, 15, 1, 1, 9, 37, 65, 31, 1, 1, 11, 61, 175, 211, 63, 1, 1, 13, 91, 369, 781, 665, 127, 1, 1, 15, 127, 671, 2101, 3367, 2059, 255, 1, 1, 17, 169, 1105, 4651, 11529, 14197, 6305, 511, 1, 1, 19, 217, 1695, 9031

Offset: 0

N. J. A. Sloane

If each row started with an initial 0 (i.e., a(n,k) = (n+1)^k - n^k) then each row would be the binomial transform of the preceding row. - Henry Bottomley, May 31 2001
a(n-1, k-1) is the number of ordered k-tuples of positive integers such that the largest of these integers is n. - Alford Arnold, Sep 07 2005
From Alford Arnold, Jul 21 2006: (Start)
The sequences in A047969 can also be calculated using the Eulerian Array (A008292) and Pascal's Triangle (A007318) as illustrated below: (cf. A101095).
  1       1       1       1       1       1
  1       1       1       1       1       1
  -----------------------------------------
  1       2       3       4       5       6
          1       2       3       4       5
  1       3       5       7       9      11
  -----------------------------------------
  1       3       6      10      15      21
          4      12      24      40      60
                  1       3       6      10
  1       7      19      37      61      91
  -----------------------------------------
  1       4      10      20      35      56
         11      44     110     220     385
                 11      44     110     220
                          1       4      10
  1      15      65     175     369     671
  -----------------------------------------  (End)
From Peter Bala, Oct 26 2008: (Start)
The above remarks of Alford Arnold may be summarized by saying that (the transpose of) this array is the Hilbert transform of the triangle of Eulerian numbers A008292 (see A145905 for the definition of the Hilbert transform). In this context, A008292 is best viewed as the array of h-vectors of permutohedra of type A. See A108553 for the Hilbert transform of the array of h-vectors of type D permutohedra. Compare this array with A009998.
The polynomials n^k - (n-1)^k, k = 1,2,3,..., which give the nonzero entries in the columns of this array, satisfy a Riemann hypothesis: their zeros lie on the vertical line Re s = 1/2 in the complex plane. See A019538 for the connection between the polynomials n^k - (n-1)^k and the Stirling polynomials of the simplicial complexes dual to the type A permutohedra.
(End)
Empirical: (n+1)^(k+1) - n^(k+1) is the number of first differences of length k+1 arrays of numbers in 0..n, k > 0. - R. H. Hardin, Jun 30 2013
a(n-1, k-1) is the number of bargraphs of width k and height n. Examples: a(1,2) = 7 because we have [1,1,2], [1,2,1], [2,1,1], [1,2,2], [2,1,2], [2,2,1], and [2,2,2]; a(2,1) = 5 because we have [1,3], [2,3], [3,1], [3,2], and [3,3] (bargraphs are given as compositions). This comment is equivalent to A. Arnold's Sep 2005 comment. - Emeric Deutsch, Jan 30 2017

			Array a begins:
  [n\k][0  1   2    3    4   5  6  ...
  [0]   1  1   1    1    1   1  1  ...
  [1]   1  3   7   15   31  63  ...
  [2]   1  5  19   65  211  ...
  [3]   1  7  37  175  ...
  ...
Triangle T begins:
  n\m   0   1    2     3     4      5      6      7      8     9  10 ...
  0:    1
  1:    1   1
  2:    1   3    1
  3:    1   5    7     1
  4:    1   7   19    15     1
  5:    1   9   37    65    31      1
  6:    1  11   61   175   211     63      1
  7:    1  13   91   369   781    665    127      1
  8:    1  15  127   671  2101   3367   2059    255      1
  9:    1  17  169  1105  4651  11529  14197   6305    511     1
  10:   1  19  217  1695  9031  31031  61741  58975  19171  1023   1
  ...  - _Wolfdieter Lang_, May 07 2021

J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 54.

T. D. Noe, Rows n = 0..100 of triangle, flattened
A. Blecher, C. Brennan, A. Knopfmacher and Helmut Prodinger, The height and width of bargraphs, Discrete Applied Math. 180, (2015), 36-44.
Eric Weisstein's World of Mathematics, Nexus Number

Cf. A047970.
Cf. A009998, A108553 (Hilbert transform of array of h-vectors of type D permutohedra), A145904, A145905.
Row n sequences of array a: A000012, A000225(k+1), A001047(k+1), A005061(k+1), A005060(k+1), A005062(k+1), A016169(k+1), A016177(k+1), A016185(k+1), A016189(k+1), A016195(k+1), A016197(k+1).
Column k sequences of array a: (nexus numbers): A000012, A005408, A003215, A005917(n+1), A022521, A022522, A022523, A022524, A022525, A022526, A022527, A022528.
Cf. A343237 (row reversed triangle).

Flatten[Table[n = d - e; k = e; (n + 1)^(k + 1) - n^(k + 1), {d, 0, 100}, {e, 0, d}]] (* T. D. Noe, Feb 22 2012 *)

T(n,m):=if m=0 then 1 else sum(k!*(-1)^(m+k)*stirling2(m,k)*binomial(n+k-1,n),k,0,m); /* Vladimir Kruchinin, Jan 28 2018 */

From Vladimir Kruchinin: (Start)
O.g.f. of e.g.f of rows of array: ((1-x)*exp(y))/(1-x*exp(y))^2.
T(n,m) = Sum_{k=0..m} k!*(-1)^(m+k)*Stirling2(m,k)*C(n+k-1,n), T(n,0)=1.(End)
From Wolfdieter Lang, May 07 2021: (Start)
T(n,m) = a(n-m,m) = (n-m+1)^(m+1) - (n-m)^(m+1), n >= 0, m = 0, 1,..., n.
O.g.f. column k of the array: polylog(-(k+1), x)*(1-x)/x. See the Peter Bala comment above, and the Eulerian triangle A008292 formula by Vladeta Jovovic, Sep 02 2002.
E.g.f. of e.g.f. of row of the array: exp(y)*(1 + x*(exp(y) - 1))*exp(x*exp(y)).
O.g.f. of triangle's exponential row polynomials R(n, y) = Sum_{m=0} T(n, m)*(y^m)/m!: G(x, y) = exp(x*y)*(1 - x)/(1 - x*exp(x*y))^2. (End)

A022521 a(n) = (n+1)^5 - n^5.

Original entry on oeis.org

1, 31, 211, 781, 2101, 4651, 9031, 15961, 26281, 40951, 61051, 87781, 122461, 166531, 221551, 289201, 371281, 469711, 586531, 723901, 884101, 1069531, 1282711, 1526281, 1803001, 2115751, 2467531

Offset: 0

N. J. A. Sloane

Last digit of a(n) is always 1. Last two digits of a(n) (i.e., a(n) mod 100) are repeated periodically with palindromic part of period 20 {1,31,11,81,1,51,31,61,81,51,51,81,61,31,51,1,81,11,31,1}. Last three digits of a(n) (i.e., a(n) mod 1000) are repeated periodically with palindromic part of period 200. - Alexander Adamchuk, Aug 11 2006
In Conway and Guy, these numbers are called nexus numbers of order 5. - M. F. Hasler, Jan 27 2013
Numbers that can be arranged in a triangular-antitegmatic icosachoron (the 4D version of "rhombic dodecahedal numbers" (A005917)). - Steven Lu, Mar 28 2023

John H. Conway and Richard K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 54.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Polytope Wiki, Triangular-antitegmatic Icosachoron
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

First differences of A000584.
Column k=4 of array A047969.
Cf. A003215, A005917, A006322, A008292, A019916, A019952, A022522.

[(n+1)^5-n^5: n in [0..30]]; // Vincenzo Librandi, Nov 23 2011

Table[(n+1)^5-n^5, {n,0,30}] (* Vincenzo Librandi, Nov 23 2011 *)

a(n)=(n+1)^5-n^5 \\ Charles R Greathouse IV, Sep 24 2015

a(n) = A003215(n) + 24 * A006322(n). - Xavier Acloque, Oct 11 2003
G.f.: (-1-x^4-26*x^3-66*x^2-26*x)/(x-1)^5. - Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009
G.f.: polylog(-5, x)*(1-x)/x. See the g.f. of the rows of A008292 by Vladeta Jovovic, Sep 02 2002. - Wolfdieter Lang, May 10 2021
Sum_{n>=0} 1/a(n) = c1*tanh(c2/2) - c2*tanh(c1/2), where c1 = tan(3*Pi/10)*Pi and c2 = tan(Pi/10)*Pi. - Amiram Eldar, Jan 27 2022

A022523 Nexus numbers (n+1)^7-n^7.

Original entry on oeis.org

1, 127, 2059, 14197, 61741, 201811, 543607, 1273609, 2685817, 5217031, 9487171, 16344637, 26916709, 42664987, 65445871, 97576081, 141903217, 201881359, 281651707, 386128261, 521088541, 693269347, 910467559, 1181645977, 1517044201, 1928294551, 2428543027

Offset: 0

N. J. A. Sloane

J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 54.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
H. D. Nguyen, D. Taggart, Mining the OEIS: Ten Experimental Conjectures, 2013; citseerx. Mentions this sequence. - From _N. J. A. Sloane_, Mar 16 2014
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

First differences of A001015.
Cf. A008292, A022522, A022524.
Column k=6 of array A047969.

[(n+1)^7-n^7: n in [0..30]]; // Vincenzo Librandi, Nov 22 2011

q=7;lst={};Do[AppendTo[lst,(n+1)^q-n^q],{n,0,3*4!}];lst (* Vladimir Joseph Stephan Orlovsky, Jan 23 2009 *)
Table[(n+1)^7-n^7,{n,0,20}] (* Vincenzo Librandi, Nov 22 2011 *)
LinearRecurrence[{7,-21,35,-35,21,-7,1},{1,127,2059,14197,61741,201811,543607},30] (* Harvey P. Dale, Apr 17 2017 *)
Differences[Range[0,50]^7] (* Harvey P. Dale, Jun 07 2023 *)

a(n)=(n+1)^7-n^7 \\ Charles R Greathouse IV, Sep 28 2015

G.f.: -(x^6+120*x^5+1191*x^4+2416*x^3+1191*x^2+120*x+1) / (x-1)^7. - Colin Barker, Dec 21 2012

G.f.: polylog(-7, x)*(1-x)/x. See the g.f. of the rows of A008292 by Vladeta Jovovic, Sep 02 2002. - Wolfdieter Lang, May 10 2021

A101104 a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4.

Original entry on oeis.org

1, 12, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24

Offset: 1

Cecilia Rossiter, Dec 15 2004

Original name: The first summation of row 4 of Euler's triangle - a row that will recursively accumulate to the power of 4.

D. J. Pengelley, The bridge between the continuous and the discrete via original sources in Study the Masters: The Abel-Fauvel Conference [pdf], Kristiansand, 2002, (ed. Otto Bekken et al), National Center for Mathematics Education, University of Gothenburg, Sweden, in press.
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Dead link]
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Cached copy, May 15 2013]
Eric Weisstein, Link to section of MathWorld: Worpitzky's Identity of 1883
Eric Weisstein, Link to section of MathWorld: Eulerian Number
Eric Weisstein, Link to section of MathWorld: Nexus number
Eric Weisstein, Link to section of MathWorld: Finite Differences
Index entries for linear recurrences with constant coefficients, signature (1).

For other sequences based upon MagicNKZ(n,k,z):
..... |  n = 1  |  n = 2  |  n = 3  |  n = 4  |  n = 5  |  n = 6  |  n = 7
---------------------------------------------------------------------------
z = 0 | A000007 | A019590 | .......MagicNKZ(n,k,0) = A008292(n,k+1) .......
z = 1 | A000012 | A040000 | A101101 | thisSeq | A101100 | ....... | .......
z = 2 | A000027 | A005408 | A008458 | A101103 | A101095 | ....... | .......
z = 3 | A000217 | A000290 | A003215 | A005914 | A101096 | ....... | .......
z = 4 | A000292 | A000330 | A000578 | A005917 | A101098 | ....... | .......
z = 5 | A000332 | A002415 | A000537 | A000583 | A022521 | ....... | A255181
z = 6 | A000389 | A005585 | A024166 | A000538 | A000584 | A022522 | A255177
z = 7 | A000579 | A040977 | A101094 | A101089 | A000539 | A001014 | A022523
z = 8 | A000580 | A050486 | A101097 | A101090 | A101092 | A000540 | A001015
z = 9 | A000581 | A053347 | A101102 | A101091 | A101099 | A101093 | A000541
Cf. A101095 for an expanded table and more about MagicNKZ.

MagicNKZ = Sum[(-1)^j*Binomial[n+1-z, j]*(k-j+1)^n, {j, 0, k+1}];Table[MagicNKZ, {n, 4, 4}, {z, 1, 1}, {k, 0, 34}]
Join[{1, 12, 23},LinearRecurrence[{1},{24},56]] (* Ray Chandler, Sep 23 2015 *)

a(k) = MagicNKZ(4,k,1) where MagicNKZ(n,k,z) = Sum_{j=0..k+1} (-1)^j*binomial(n+1-z,j)*(k-j+1)^n (cf. A101095). That is, a(k) = Sum_{j=0..k+1} (-1)^j*binomial(4, j)*(k-j+1)^4.
a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4. - Joerg Arndt, Nov 30 2014
G.f.: x*(1+11*x+11*x^2+x^3)/(1-x). - Colin Barker, Apr 16 2012

New name from Joerg Arndt, Nov 30 2014

Original Formula edited and Crossrefs table added by Danny Rorabaugh, Apr 22 2015

A101095 Fourth difference of fifth powers (A000584).

Original entry on oeis.org

1, 28, 121, 240, 360, 480, 600, 720, 840, 960, 1080, 1200, 1320, 1440, 1560, 1680, 1800, 1920, 2040, 2160, 2280, 2400, 2520, 2640, 2760, 2880, 3000, 3120, 3240, 3360, 3480, 3600, 3720, 3840, 3960, 4080, 4200, 4320, 4440, 4560, 4680, 4800, 4920, 5040, 5160, 5280

Offset: 1

Cecilia Rossiter, Dec 15 2004

Original Name: Shells (nexus numbers) of shells of shells of shells of the power of 5.

The (Worpitzky/Euler/Pascal Cube) "MagicNKZ" algorithm is: MagicNKZ(n,k,z) = Sum_{j=0..k+1} (-1)^j*binomial(n + 1 - z, j)*(k - j + 1)^n, with k>=0, n>=1, z>=0. MagicNKZ is used to generate the n-th accumulation sequence of the z-th row of the Euler Triangle (A008292). For example, MagicNKZ(3,k,0) is the 3rd row of the Euler Triangle (followed by zeros) and MagicNKZ(10,k,1) is the partial sums of the 10th row of the Euler Triangle. This sequence is MagicNKZ(5,k-1,2).

Danny Rorabaugh, Table of n, a(n) for n = 1..10000
D. J. Pengelley, The bridge between the continuous and the discrete via original sources in Study the Masters: The Abel-Fauvel Conference [pdf], Kristiansand, 2002, (ed. Otto Bekken et al), National Center for Mathematics Education, University of Gothenburg, Sweden, in press.
Cecilia Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Archive Machine link]
Cecilia Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Cached copy, May 15 2013]
Eric Weisstein, Link to section of MathWorld: Worpitzky's Identity of 1883
Eric Weisstein, Link to section of MathWorld: Eulerian Number
Eric Weisstein, Link to section of MathWorld: Nexus number
Eric Weisstein, Link to section of MathWorld: Finite Differences
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Fourth differences of A000584, third differences of A022521, second differences of A101098, and first differences of A101096.
For other sequences based upon MagicNKZ(n,k,z):
...... |  n = 1  |  n = 2  |  n = 3  |  n = 4  |  n = 5  |  n = 6  |  n = 7  |  n = 8
--------------------------------------------------------------------------------------
z =  0 | A000007 | A019590 | .......  MagicNKZ(n,k,0) = T(n,k+1) from A008292  .......
z =  1 | A000012 | A040000 | A101101 | A101104 | A101100 | ....... | ....... | .......
z =  2 | A000027 | A005408 | A008458 | A101103 | thisSeq | ....... | ....... | .......
z =  3 | A000217 | A000290 | A003215 | A005914 | A101096 | ....... | ....... | .......
z =  4 | A000292 | A000330 | A000578 | A005917 | A101098 | ....... | ....... | .......
z =  5 | A000332 | A002415 | A000537 | A000583 | A022521 | ....... | A255181 | .......
z =  6 | A000389 | A005585 | A024166 | A000538 | A000584 | A022522 | A255177 | A255182
z =  7 | A000579 | A040977 | A101094 | A101089 | A000539 | A001014 | A022523 | A255178
z =  8 | A000580 | A050486 | A101097 | A101090 | A101092 | A000540 | A001015 | A022524
z =  9 | A000581 | A053347 | A101102 | A101091 | A101099 | A101093 | A000541 | A001016
z = 10 | A000582 | A054333 | A254469 | A254681 | A254644 | A254640 | A250212 | A000542
z = 11 | A001287 | A054334 | A254869 | A254470 | A254682 | A254645 | A254641 | A253636
z = 12 | A001288 | A057788 | ....... | A254870 | A254471 | A254683 | A254646 | A254642
z = 13 | A010965 | ....... | ....... | ....... | A254871 | A254472 | A254684 | A254647
z = 14 | A010966 | ....... | ....... | ....... | ....... | A254872 | ....... | .......
--------------------------------------------------------------------------------------
Cf. A047969.

I:=[1,28,121,240,360]; [n le 5 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // Vincenzo Librandi, May 07 2015

MagicNKZ=Sum[(-1)^j*Binomial[n+1-z, j]*(k-j+1)^n, {j, 0, k+1}];Table[MagicNKZ, {n, 5, 5}, {z, 2, 2}, {k, 0, 34}]
CoefficientList[Series[(1 + 26 x + 66 x^2 + 26 x^3 + x^4)/(1 - x)^2, {x, 0, 50}], x] (* Vincenzo Librandi, May 07 2015 *)
Join[{1,28,121,240},Differences[Range[50]^5,4]] (* or *) LinearRecurrence[{2,-1},{1,28,121,240,360},50] (* Harvey P. Dale, Jun 11 2016 *)

a(n)=if(n>3, 120*n-240, 33*n^2-72*n+40) \\ Charles R Greathouse IV, Oct 11 2015

[1,28,121]+[120*(k-2) for k in range(4,36)] # Danny Rorabaugh, Apr 23 2015

a(k+1) = Sum_{j=0..k+1} (-1)^j*binomial(n + 1 - z, j)*(k - j + 1)^n; n = 5, z = 2.
For k>3, a(k) = Sum_{j=0..4} (-1)^j*binomial(4, j)*(k - j)^5 = 120*(k - 2).
a(n) = 2*a(n-1) - a(n-2), n>5. G.f.: x*(1+26*x+66*x^2+26*x^3+x^4) / (1-x)^2. - Colin Barker, Mar 01 2012

MagicNKZ material edited, Crossrefs table added, SeriesAtLevelR material removed by Danny Rorabaugh, Apr 23 2015

Name changed and keyword 'uned' removed by Danny Rorabaugh, May 06 2015

A199656 Triangular array read by rows, T(n,k) is the number of functions from {1,2,...,n} into {1,2,...,n} with maximum value of k.

Original entry on oeis.org

1, 1, 3, 1, 7, 19, 1, 15, 65, 175, 1, 31, 211, 781, 2101, 1, 63, 665, 3367, 11529, 31031, 1, 127, 2059, 14197, 61741, 201811, 543607, 1, 255, 6305, 58975, 325089, 1288991, 4085185, 11012415, 1, 511, 19171, 242461, 1690981, 8124571, 30275911, 93864121, 253202761

Offset: 1

Geoffrey Critzer, Nov 08 2011

Row sums = A000312.

Main diagonal = A045531.

			Triangle begins:
  1
  1    3
  1    7   19
  1   15   65   175
  1   31  211   781   2101
  1   63  665  3367  11529   31031
  1  127 2059 14197  61741  201811  543607
  ...

Vincenzo Librandi, Rows n = 1..60, flattened

Cf. A022522, A022523.

/* As triangle: */ [[k^n - (k-1)^n: k in [1..n]]: n in [1..9]]; // Vincenzo Librandi, Jan 28 2013

Table[Table[(1-((i-1)/i)^n) i^n,{i,1,n}],{n,1,8}]//Grid
Flatten[Table[k^n - (k-1)^n, {n, 0, 10}, {k, 1, n}]] (* Vincenzo Librandi, Jan 28 2013 *)

T(n,k) = k^n-(k-1)^n.

A254645 Fourth partial sums of sixth powers (A001014).

Original entry on oeis.org

1, 68, 995, 7672, 40614, 166992, 571626, 1701480, 4534959, 11050468, 24997973, 53113424, 106959580, 205628736, 379603812, 676144944, 1166649837, 1956528420, 3198236503, 5108229896, 7988730530, 12255340240

Offset: 1

Luciano Ancora, Feb 05 2015

			First differences:   1, 63, 665, 3367, 11529,  31031, ...  (A022522)
--------------------------------------------------------------------------
The sixth powers:    1, 64, 729, 4096, 15625,  46656, ...  (A001014)
--------------------------------------------------------------------------
First partial sums:  1, 65, 794, 4890, 20515,  67171, ...  (A000540)
Second partial sums: 1, 66, 860, 5750, 26265,  93436, ...  (A101093)
Third partial sums:  1, 67, 927, 6677, 32942, 126378, ...  (A101099)
Fourth partial sums: 1, 68, 995, 7672, 40614, 166992, ...  (this sequence)

Luciano Ancora, Table of n, a(n) for n = 1..1000
Luciano Ancora, Partial sums of m-th powers with Faulhaber polynomials
Luciano Ancora, Pascal’s triangle and recurrence relations for partial sums of m-th powers
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

Cf. A000540, A001014, A022522, A101093, A101099.

Cf. A254644 (fourth partial sums of fifth powers), A254646 (fourth partial sums of seventh powers).

List([1..30], n-> Binomial(n+4,5)*(n+2)*((n^2+4*n-1)^2-2)/42); # G. C. Greubel, Aug 28 2019

[Binomial(n+4,5)*(n+2)*((n^2+4*n-1)^2-2)/42: n in [1..30]]; // G. C. Greubel, Aug 28 2019

seq(binomial(n+4,5)*(n+2)*((n^2+4*n-1)^2-2)/42, n=1..30); # G. C. Greubel, Aug 28 2019

Table[n (1 + n) (2 + n)^2 (3 + n) (4 + n) (- 1 - 8 n + 14 n^2 + 8 n^3 + n^4)/5040, {n, 22}] (* or *)
Accumulate[Accumulate[Accumulate[Accumulate[Range[22]^6]]]] (* or *)
CoefficientList[Series[(- 1 - 57 x - 302 x^2 - 302 x^3 - 57 x^4 - x^5)/(- 1 + x)^11, {x, 0, 21}], x]
Nest[Accumulate,Range[30]^6,4] (* or *) LinearRecurrence[{11,-55,165,-330,462,-462,330,-165,55,-11,1},{1,68,995,7672,40614,166992,571626,1701480,4534959,11050468,24997973},30] (* Harvey P. Dale, Dec 27 2015 *)

vector(30, n, binomial(n+4,5)*(n+2)*((n^2+4*n-1)^2-2)/42) \\ G. C. Greubel, Aug 28 2019

[binomial(n+4,5)*(n+2)*((n^2+4*n-1)^2-2)/42 for n in (1..30)] # G. C. Greubel, Aug 28 2019

G.f.: x*(1 + 57*x + 302*x^2 + 302*x^3 + 57*x^4 + x^5)/(1 - x)^11.
a(n) = n*(1 + n)*(2 + n)^2*(3 + n)*(4 + n)*(- 1 - 8*n + 14*n^2 + 8*n^3 + n^4)/5040.
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + n^6.

A254683 Fifth partial sums of sixth powers (A001014).

Original entry on oeis.org

1, 69, 1064, 8736, 49350, 216342, 787968, 2489448, 7024407, 18074875, 43072848, 96186272, 203145852, 408774588, 788378400, 1464523344, 2631173181, 4587701601, 7785938104, 12894168000, 20882898530, 33138238770

Offset: 1

Luciano Ancora, Feb 12 2015

			First differences:   1, 63,  665, 3367, 11529, ...  (A022522)
--------------------------------------------------------------------------
The sixth powers:    1, 64,  729, 4096, 15625, ...  (A001014)
--------------------------------------------------------------------------
First partial sums:  1, 65,  794, 4890, 20515, ...  (A000540)
Second partial sums: 1, 66,  860, 5750, 26265, ...  (A101093)
Third partial sums:  1, 67,  927, 6677, 32942, ...  (A254640)
Fourth partial sums: 1, 68,  995, 7672, 40614, ...  (A254645)
Fifth partial sums:  1, 69, 1064, 8736, 49350, ...  (this sequence)

Luciano Ancora, Table of n, a(n) for n = 1..1000
Luciano Ancora, Partial sums of m-th powers with Faulhaber polynomials
Luciano Ancora, Pascal’s triangle and recurrence relations for partial sums of m-th powers
Index entries for linear recurrences with constant coefficients, signature (12,-66,220,-495,792,-924,792,-495,220,-66,12,-1).

Cf. A000540, A001014, A022522, A101093, A254640, A254645, A254681, A254682, A254684.

Table[n (1 + n) (2 + n) (3 + n) (4 + n) (5 + n) (5 + 2*n) (- 3 + 5*n + n^2) (4 + 15 n + 3 n^2)/332640, {n,22}] (* or *)
CoefficientList[Series[(1 + 57 x + 302 x^2 + 302 x^3 + 57 x^4 + x^5)/(- 1 + x)^12, {x,0,21}], x]

G.f.: (x + 57*x^2 + 302*x^3 + 302*x^4 + 57*x^5 + x^6)/(- 1 + x)^12.
a(n) = n*(1 + n)*(2 + n)*(3 + n)*(4 + n)*(5 + n)*(5 + 2*n)*(- 3 + 5*n + n^2)*(4 + 15*n + 3*n^2)/332640.
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) + n^6.

cp's OEIS Frontend

A069473 First differences of (n+1)^6-n^6 (A022522).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A001014 Sixth powers: a(n) = n^6.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

Maxima

PARI

Python

Formula

Extensions

A047969 Square array of nexus numbers a(n,k) = (n+1)^(k+1) - n^(k+1) (n >= 0, k >= 0) read by upwards antidiagonals.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Maxima

Formula

A022521 a(n) = (n+1)^5 - n^5.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A022523 Nexus numbers (n+1)^7-n^7.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A101104 a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A101095 Fourth difference of fifth powers (A000584).

Views