|
| |
(in formats from the Mathematica program, from
Wolfram Research, Inc.)
SeriesAtLevelR =
![Underoverscript[∑, i = 1, arg3] (-i + n + r + x) Eulerian(n, i - 1) n + r](../_private/images/copy%20of%20index_3.gif)
(employing the "add-in"
)
see also
these formulas expanded and
these
formulas factored or
a chart of
initial numerical values
r=-1
| n=1 1
ones or 1st Pascal Triangle Figurate numbers or
binomial coefficients C(n,0). |
| n=2 2 x - 1
A005408
The odd numbers. |
| n=3 3 (x - 1) x + 1
A003215
Hex (or centered hexagonal) numbers (crystal ball sequence for hexagonal
lattice). |
| n=4 2 x (x (2 x - 3) + 2) - 1
A005917
Rhombic dodecahedral numbers |
| n=5 5 (x - 1) x ((x - 1) x + 1) + 1
A022521
Nexus numbers for the power of 5. |
| n=6 (2 x - 1) ((x - 1) x + 1) (3 (x - 1) x + 1)
A022522
Nexus numbers for the power of 6. |
n=7
A022523
Nexus numbers for the power of 7. |
| n=8 (2 x - 1) (2 (x - 1) x + 1) (2 (x - 1) x ((x - 1) x + 2) + 1)
A022524
Nexus numbers for the power of 8. |
| n=9 (3 (x - 1) x + 1) (3 (x - 1) x ((x - 1) x + 1) ((x - 1) x + 2) + 1)
A022525
Nexus numbers for the power of 9. |
| n=10 (2 x - 1) (5 (x - 1) x ((x - 1) x + 1) + 1) ((x - 1) x ((x - 1) x + 3) + 1)
A022526
Nexus numbers for the power of 10. |
| n=11 11 (x - 1) x ((x - 1) x + 1) ((x - 1) x ((x - 1) x + 1) ((x - 1) x + 3) + 1) + 1
A022527
Nexus numbers for the power of 11. |
| n=12 (2 x - 1) ((x - 1) x + 1) (2 (x - 1) x + 1) (3 (x - 1) x + 1) ((x - 1) x ((x - 1) x + 4) + 1)
A022528
Nexus numbers for the power of 12. |
n=13
A022529
Nexus numbers for the power of 13. |
n=14
A022530
Nexus numbers for the power of 14. |
|
r=0
| n=1 x
Integers or the power of 1. |
n=2
A000290
The squares. |
n=3
A000578
The cubes. |
n=4
A000583
The fourth power. "Figurate numbers based on 4-dimensional regular
convex polytope
called the 4-measure polytope, 4-hypercube or tessaract with
Schlafli symbol {4,3,3}. - Michael J. Welch (mjw1(AT)ntlworld.com), Apr 01
2004" |
n=5
A000584
The fifth power. |
n=6
A001014
The sixth power. Numbers both square and cubic -
pdg(AT)worldofnumbers.com. |
n=7
A001015
The seventh power. |
n=8
A001016
The eighth power. |
n=9
A001017
The ninth power. |
n=10
A008454
The tenth power. |
n=11
A008455
The eleventh power. |
n=12
A008456
The twelfth power. |
n=13
A010801
The 13th power. |
n=14
A010802
The 14th power. |
|
r=1
n=1
A000217
3rd Pascal Triangle Figurate numbers or binomial coefficients C(n,2). |
n=2
A000330
Square pyramidal numbers. |
n=3
A000537
Sum of first n cubes; or n-th triangular number squared. |
n=4
A000538
Sum of fourth powers: 0^4+1^4+...+n^4. |
n=5
A000539
Sum of 5th powers: 1^5 + 2^5 + ... + n^5. |
n=6
A000540
Sum of 6th powers: 1^6 + 2^6 + ... + n^6. |
n=7
A000541
Sum of 7th powers: 1^7 + 2^7 + ... + n^7. |
n=8
A000542
Sum of 8th powers: 1^8 + 2^8 + ... + n^8. |
n=9
A007487
Sum of 9th powers. |
n=10
A023002
Sum of 10th powers. |
n=11
Sum
of 11th powers. |
n=12
Sum
of 12th powers. |
n=13
Sum
of 13th powers. |
n=14
Sum
of 14th powers. |
|
r=2
n=1
A000292
4th Pascal Triangle Figurate numbers or binomial coefficients C(n,3). |
n=2
A002415
4-dimensional pyramidal numbers: n^2*(n^2-1)/12.
Also number of ways to legally insert two pairs of parentheses into a
string of m := n-1 letters. (There are initially
2C(m+4,4) (A034827)
ways to insert the parentheses, but we must subtract
2(m+1) for illegal
clumps of 4 parentheses, 2m(m+1) for clumps of 3
parentheses, C(m+1,2)
for 2 clumps of 2 parentheses, and (m-1)C(m+1,2) for 1
clump of 2
parentheses, giving m(m+1)^2(m+2)/12 = n^2*(n^2-1)/12.)
E.g. for n=2
there are 6 ways: ((a))b, ((a)b), ((ab)), (a)(b), (a(b)),a((b)). |
n=3
A085437
or
A024166
Sum of (j-i)^3 for 1 <= i < j <= n. |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=3
n=1
A000332
5th Pascal Triangle Figurate numbers or binomial coefficients C(n,4). |
n=2
A005585
5-dimensional pyramidal numbers: n(n+1) ... (n+3)(2n+3)/5!. |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=4
n=1
A000389
6th Pascal Triangle Figurate numbers or binomial coefficients C(n,5). |
n=2
A040977
C(n+5,5)*(n+3)/3; Sequence is n^2*(n^2-1)*(n^2-4)/360 if offset 3. |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=5
n=1
A000579
7th Pascal Triangle Figurate numbers or binomial coefficients C(n,6). |
n=2
A050486
C(n+6,6)*(2n+7)/7. |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
see also
these formulas expanded or
a chart of
initial numerical values
x=1
| n=1 1
ones or 1st Pascal Triangle Figurate numbers or binomial
coefficients C(n,0). |
| n=2 1 |
| n=3 1 |
| n=4 1 |
| n=5 1 |
| n=6 1 |
| n=7 1 |
| n=8 1 |
| n=9 1 |
| n=10
1 |
| n=11 1 |
| n=12 1 |
| n=13 1 |
| n=14 1 |
|
x=2
| n=1 r + 2
integers or the 2nd Pascal Triangle Figurate numbers or binomial coefficients
C(n,1). |
| n=2 r + 4 |
| n=3 r + 8 |
| n=4 r + 16 |
| n=5 r + 32 |
| n=6 r + 64 |
| n=7 r + 128 |
| n=8 r + 256 |
| n=9 r + 512 |
| n=10 r + 1024 |
| n=11 r + 2048 |
| n=12 r + 4096 |
| n=13 r + 8192 |
| n=14 r + 16384 |
|
x=3
n=1
A000217
3rd Pascal Triangle Figurate numbers or binomial coefficients C(n,2). |
n=2
A000096 |
n=3
A051936
Truncated triangular numbers: a(n)=n*(n+1)/2-9 or
A060533
Number of homeomorphically irreducible multigraphs (or series-reduced
multigraphs or multigraphs without nodes of degree 2) on 3 labeled nodes. |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=4
n=1
A000292
4th Pascal Triangle Figurate numbers or binomial coefficients C(n,3). |
n=2
A005581
A class of Boolean functions of n variables and rank 2. |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=5
n=1
A000332
5th Pascal Triangle Figurate numbers or binomial coefficients C(n,4). |
n=2
A005582 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=6
n=1
A000389
6th Pascal Triangle Figurate numbers or binomial coefficients C(n,5). |
n=2
A005583
Coefficients of Chebyshev polynomials |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=7
n=1
A000579
7th Pascal Triangle Figurate numbers or binomial coefficients C(n,6). |
n=2
A005584
Coefficients of Chebyshev polynomials. |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
see
a chart
of initial numerical values
| |
r=-1 |
r=0 |
r=1 |
r=2 |
r=3 |
| x=1 |
![Underoverscript[∑, i = 1, arg3] (n - i) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_910.gif)
ones |
![Underoverscript[∑, i = 1, arg3] (-i + n + 1) Eulerian(n, i - 1) n](../_private/images/copy%20of%20index_922.gif)
ones |
![Underoverscript[∑, i = 1, arg3] (-i + n + 2) Eulerian(n, i - 1) n + 1](../_private/images/copy%20of%20index_934.gif)
ones |
![Underoverscript[∑, i = 1, arg3] (-i + n + 3) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_946.gif)
ones |
![Underoverscript[∑, i = 1, arg3] (-i + n + 4) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_958.gif)
ones |
| x=2 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 1) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_911.gif)
A000225
2^n - 1. Sometimes called Mersenne numbers. |
A008776
Pisot sequences* E(2,6), L(2,6), P(2,6), T(2,6).
or
Powers of 2.
|
A000051
Pisot sequence* L(2,3) or 2^n + 1. |
A052548
2^n+2. Recurrence: {a(0)=3,a(1)=4,
-2*a(n)+a(n+1)+2} |
A062709
2^n+3. a(n) = 2a(n-1)-3. |
| x=3 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 2) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_912.gif)
A001047
3^n - 2^n. |
A000244
Pisot sequences* E(1,3), L(1,3), P(1,3), T(1,3) or Powers of 3.
|
A001550
1^n + 2^n + 3^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 5) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_948.gif) |
A087719
"Least number m
such that the number of numbers k<=m with
k>spf(k)^n exceeds the number of numbers with k<=spf(k)^n.
m<a(n): #{k: k>spf(k)^n
& 1<=k<=m} <= m/2;
m>=a(n): #{k: k>spf(k)^n
& 1<=k<=m} > m/2."
a(n)
= 3^n + 3*2^n + 6. |
| x=4 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 3) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_913.gif)
A005061
4^n - 3^n. |
A000302
Pisot sequences* E(1,4), L(1,4), P(1,4), T(1,4) or Powers of 4.
|
A001551
1^n + 2^n + 3^n + 4^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 6) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_949.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 7) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_961.gif) |
| x=5 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 4) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_914.gif)
A005060
5^n - 4^n. |
A000351
Pisot sequences* E(1,5), L(1,5), P(1,5), T(1,5) or Powers of 5.
|
A001552
1^n + 2^n + ... + 5^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 7) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_950.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 8) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_962.gif) |
| x=6 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 5) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_915.gif)
A005062
6^n - 5^n. |
A000400
Pisot sequences* E(1,6), L(1,6), P(1,6), T(1,6)or Powers of 6. |
A001553
1^n + 2^n + ... + 6^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 8) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_951.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 9) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_963.gif) |
| x=7 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 6) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_916.gif)
A016169
7^n - 6^n. |
A000420
Pisot sequences E(1,7), L(1,7), P(1,7), T(1,7) or Powers of 7. |
A001554
1^n + 2^n + ... + 7^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 9) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_952.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 10) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_964.gif) |
| x=8 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 7) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_917.gif)
A016177
8^n - 7^n. |
A001018
Pisot sequences* E(1,8), L(1,8), P(1,8), T(1,8)
or Powers of 8. |
A001555
1^n + 2^n + ... + 8^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 10) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_953.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 11) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_965.gif) |
| x=9 |
![Underoverscript[∑, i = 1, arg3] (-i + n + 8) Eulerian(n, i - 1) n - 1](../_private/images/copy%20of%20index_918.gif)
A016185 9^n - 8^n.
|
A001019
Pisot sequences* E(1,9), L(1,9), P(1,9), T(1,9) or Powers of 9. |
A001556
1^n + 2^n + ... + 9^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 11) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_954.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 12) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_966.gif) |
| x=10 |
A016189 10^n - 9^n.
|
A011557
Pisot sequences* E(1,10), L(1,10), P(1,10), T(1,10) or Powers of 10. |
A001557
1^n + 2^n + ... + 10^n. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 12) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_955.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 13) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_967.gif) |
| x=11 |
A016195
11^n - 10^n.
|
A001020
Pisot sequences* E(1,11), L(1,11), P(1,11), T(1,11) or Powers of 11. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 12) Eulerian(n, i - 1) n + 1](../_private/images/copy%20of%20index_944.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 13) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_956.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 14) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_968.gif) |
| x=12 |
A016197
12^n - 11^n.
|
A001021
Pisot sequences* E(1,12), L(1,12), P(1,12), T(1,12) or Powers of 12. |
![Underoverscript[∑, i = 1, arg3] (-i + n + 13) Eulerian(n, i - 1) n + 1](../_private/images/copy%20of%20index_945.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 14) Eulerian(n, i - 1) n + 2](../_private/images/copy%20of%20index_957.gif) |
![Underoverscript[∑, i = 1, arg3] (-i + n + 15) Eulerian(n, i - 1) n + 3](../_private/images/copy%20of%20index_969.gif) |
*Pisot sequence E(x, y): a(0) = x, a(1) = y, a(n) = roundUp(a(n-1)^2/a(n-2))
= [ a(n-1)^2/a(n-2) + 1/2 ].
*Pisot sequence L(x, y): a(0) = x, a(1) = y, a(n) = ceiling(a(n-1)^2/a(n-2)).
*Pisot sequence P(x, y): a(0) = x, a(1) = y, a(n) = roundDown(a(n-1)^2/a(n-2)) =
ceiling(a(n-1)^2/a(n-2) - 1/2).
*Pisot sequence T(x, y): a(0) = x, a(1) = y, a(n) = floor(a(n-1)^2/a(n-2)) = [
a(n-1)^2/a(n-2) ].
[No Sloane sequence number for .]
see also
these
formulas fully simplified or
a chart of
initial numerical values
x=1
| n=1 1
ones or 1st Pascal Triangle Figurate numbers or
binomial coefficients C(n,0). |
| n=2 1 |
| n=3 1 |
| n=4 1 |
| n=5 1 |
| n=6 1 |
| n=7 1 |
| n=8 1 |
| n=9 1 |
| n=10 1 |
| n=11 1 |
| n=12 1 |
| n=13 1 |
| n=14 1 |
|
x=2
| n=1 r + 2
integers or the 2nd Pascal Triangle Figurate numbers or binomial coefficients
C(n,1). |
| n=2 r + 4 |
| n=3 r + 8 |
| n=4 r + 16 |
| n=5 r + 32 |
| n=6 r + 64 |
| n=7 r + 128 |
| n=8 r + 256 |
| n=9 r + 512 |
| n=10 r + 1024 |
| n=11 r + 2048 |
| n=12 r + 4096 |
| n=13 r + 8192 |
| n=14 r + 16384 |
|
x=3
n=1
A000217
3rd Pascal Triangle Figurate numbers or binomial coefficients C(n,2). |
n=2
A000096 |
n=3
A051936
Truncated triangular numbers: a(n)=n*(n+1)/2-9 or
A060533
Number of homeomorphically irreducible multigraphs (or series-reduced
multigraphs or multigraphs without nodes of degree 2) on 3 labeled nodes. |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=4
n=1
A000292
4th Pascal Triangle Figurate numbers or binomial coefficients C(n,3). |
n=2
A005581
A class of Boolean functions of n variables and rank 2. |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=5
n=1
A000332
5th Pascal Triangle Figurate numbers or binomial coefficients C(n,4). |
n=2
A005582 |
n=3
|
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=6
n=1
A000389
6th Pascal Triangle Figurate numbers or binomial coefficients C(n,5). |
n=2
A005583
Coefficients of Chebyshev polynomials |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
x=7
n=1
A000579
7th Pascal Triangle Figurate numbers or binomial coefficients C(n,6). |
n=2
A005584
Coefficients of Chebyshev polynomials. |
n=3
|
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
see also
these
formulas fully simplified or
these
formulas factored or
a chart of
initial numerical values
r=-1
| n=1 1
ones or 1st Pascal Triangle Figurate numbers or
binomial coefficients C(n,0). |
| n=2 2 x - 1
A005408
The odd numbers. |
n=3
A003215
Hex (or centered hexagonal) numbers (crystal ball sequence for hexagonal
lattice). |
n=4
A005917
Rhombic dodecahedral numbers |
n=5
A022521
Nexus numbers for the power of 5. |
n=6
A022522
Nexus numbers for the power of 6. |
n=7
A022523
Nexus numbers for the power of 7. |
n=8
A022524
Nexus numbers for the power of 8. |
n=9
A022525
Nexus numbers for the power of 9. |
n=10
A022526
Nexus numbers for the power of 10. |
n=11
A022527
Nexus numbers for the power of 11. |
n=12
A022528
Nexus numbers for the power of 12. |
n=13
A022529
Nexus numbers for the power of 13. |
n=14
A022530
Nexus numbers for the power of 14. |
|
r=0
| n=1 x
Integers or the power of 1. |
n=2
A000290
The squares. |
n=3
A000578
The cubes. |
n=4
A000583
The fourth power. "Figurate numbers based on 4-dimensional regular
convex polytope
called the 4-measure polytope, 4-hypercube or tessaract with
Schlafli symbol {4,3,3}. - Michael J. Welch (mjw1(AT)ntlworld.com), Apr 01
2004" |
n=5
A000584
The fifth power. |
n=6
A001014
The sixth power. Numbers both square and cubic -
pdg(AT)worldofnumbers.com. |
n=7
A001015
The seventh power. |
n=8
A001016
The eighth power. |
n=9
A001017
The ninth power. |
n=10
A008454
The tenth power. |
n=11
A008455
The eleventh power. |
n=12
A008456
The twelfth power. |
n=13
A010801
The 13th power. |
n=14
A010802
The 14th power. |
|
r=1
n=1
A000217
3rd Pascal Triangle Figurate numbers or binomial coefficients C(n,2). |
n=2
A000330
Square pyramidal numbers. |
n=3
A000537
Sum of first n cubes; or n-th triangular number squared. |
n=4
A000538
Sum of fourth powers: 0^4+1^4+...+n^4. |
n=5
A000539
Sum of 5th powers: 1^5 + 2^5 + ... + n^5. |
n=6
A000540
Sum of 6th powers: 1^6 + 2^6 + ... + n^6. |
n=7
A000541
Sum of 7th powers: 1^7 + 2^7 + ... + n^7. |
n=8
A000542
Sum of 8th powers: 1^8 + 2^8 + ... + n^8. |
n=9
A007487
Sum of 9th powers. |
n=10
A023002
Sum of 10th powers. |
n=11
Sum
of 11th powers. |
n=12
Sum
of 12th powers. |
n=13
Sum
of 13th powers. |
n=14
Sum
of 14th powers. |
|
r=2
n=1
A000292
4th Pascal Triangle Figurate numbers or binomial coefficients C(n,3). |
|
n=2
A002415
4-dimensional pyramidal numbers: n^2*(n^2-1)/12.
Also number of ways to legally insert two pairs of parentheses into a
string of m := n-1 letters. (There are initially
2C(m+4,4) (A034827)
ways to insert the parentheses, but we must subtract
2(m+1) for illegal
clumps of 4 parentheses, 2m(m+1) for clumps of 3
parentheses, C(m+1,2)
for 2 clumps of 2 parentheses, and (m-1)C(m+1,2) for 1
clump of 2
parentheses, giving m(m+1)^2(m+2)/12 = n^2*(n^2-1)/12.)
E.g. for n=2
there are 6 ways: ((a))b, ((a)b), ((ab)), (a)(b), (a(b)),a((b)). |
n=3
A085437
or
A024166
Sum of (j-i)^3 for 1 <= i < j <= n. |
n=4
|
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=3
n=1
A000332
5th Pascal Triangle Figurate numbers or binomial coefficients C(n,4). |
n=2
A005585
5-dimensional pyramidal numbers: n(n+1) ... (n+3)(2n+3)/5!. |
n=3
|
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=4
n=1
A000389
6th Pascal Triangle Figurate numbers or binomial coefficients C(n,5). |
n=2
A040977
C(n+5,5)*(n+3)/3; Sequence is n^2*(n^2-1)*(n^2-4)/360 if offset 3. |
n=3
|
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=5
n=1
A000579
7th Pascal Triangle Figurate numbers or binomial coefficients C(n,6). |
n=2
A050486
C(n+6,6)*(2n+7)/7. |
n=3
|
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
see also
these
formulas fully simplified or
these
formulas expanded or
a chart of
initial numerical values
r=-1
| n=1 1 |
| n=2 2 x - 1 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=0
| n=1 x |
n=2
 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=1
n=1
 |
n=2
 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=2
n=1
 |
n=2
 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=3
n=1
 |
n=2
 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=4
n=1
 |
n=2
 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
r=5
n=1
 |
n=2
 |
n=3
 |
n=4
 |
n=5
 |
n=6
 |
n=7
 |
n=8
 |
n=9
 |
n=10
 |
n=11
 |
n=12
 |
n=13
 |
n=14
 |
|
|