A058649 -id:A058649 - cp's OEIS frontend

A000583 Fourth powers: a(n) = n^4.

0, 1, 16, 81, 256, 625, 1296, 2401, 4096, 6561, 10000, 14641, 20736, 28561, 38416, 50625, 65536, 83521, 104976, 130321, 160000, 194481, 234256, 279841, 331776, 390625, 456976, 531441, 614656, 707281, 810000, 923521, 1048576, 1185921

Offset: 0

N. J. A. Sloane

Figurate numbers based on 4-dimensional regular convex polytope called the 4-measure polytope, 4-hypercube or tesseract with Schlaefli symbol {4,3,3}. - Michael J. Welch (mjw1(AT)ntlworld.com), Apr 01 2004
Totally multiplicative sequence with a(p) = p^4 for prime p. - Jaroslav Krizek, Nov 01 2009
The binomial transform yields A058649. The inverse binomial transforms yields the (finite) 0, 1, 14, 36, 24, the 4th row in A019538 and A131689. - R. J. Mathar, Jan 16 2013
Generate Pythagorean triangles with parameters a and b to get sides of lengths x = b^2-a^2, y = 2*a*b, and z = a^2 + b^2. In particular use a=n-1 and b=n for a triangle with sides (x1,y1,z1) and a=n and b=n+1 for another triangle with sides (x2,y2,z2). Then x1*x2 + y1*y2 + z1*z2 = 8*a(n). - J. M. Bergot, Jul 22 2013
For n > 0, a(n) is the largest integer k such that k^4 + n is a multiple of k + n. Also, for n > 0, a(n) is the largest integer k such that k^2 + n^2 is a multiple of k + n^2. - Derek Orr, Sep 04 2014
Does not satisfy Benford's law [Ross, 2012]. - N. J. A. Sloane, Feb 08 2017
a(n+2)/2 is the area of a trapezoid with vertices at (T(n), T(n+1)), (T(n+1), T(n)), (T(n+1), T(n+2)), and (T(n+2), T(n+1)) with T(n)=A000292(n) for n >= 0. - J. M. Bergot, Feb 16 2018

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 64.
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 (6.37).
Dov Juzuk, Curiosa 56: An interesting observation, Scripta Mathematica 6 (1939), 218.
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).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, Page 47.

T. D. Noe, Table of n, a(n) for n = 0..1000
Henry Bottomley, Illustration of initial terms
Henry Bottomley, Some Smarandache-type multiplicative sequences
Ralph Greenberg, Math for Poets.
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets.
Sameen Ahmed Khan, Sums of the powers of reciprocals of polygonal numbers, Int'l J. of Appl. Math. (2020) Vol. 33, No. 2, 265-282.
Hyun Kwang Kim, On Regular Polytope Numbers, Proc. Amer. Math. Soc., Vol. 131, No. 1 (2002), pp. 65-75.
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
Kenneth A. Ross, First Digits of Squares and Cubes, Math. Mag. 85 (2012) 36-42.
Eric Weisstein's World of Mathematics, Biquadratic Number.
Index entries for "core" sequences
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
Index entries for sequences related to Benford's law

Cf. A000538, A005917 (first differences), A000332, A014820, A092181, A092182, A092183.
Cf. A004831, A002646.
Cf. A002593, A260810. - Bruno Berselli, Jul 31 2015
Cf. A002415, A000290, A006008, A132366, A039623, A139584, A071270, A047928, A187756.
Cf. A062392, A231303, A267315.

a000583 = (^ 4)
a000583_list = scanl (+) 0 a005917_list
-- Reinhard Zumkeller, Nov 13 2014, Nov 11 2012

[n^4 : n in [0..50]]; // Wesley Ivan Hurt, Sep 05 2014

A000583 := n->n^4: seq(A000583(n), n=0..50);
A000583:=-(z+1)*(z**2+10*z+1)/(z-1)**5; # Simon Plouffe in his 1992 dissertation; gives sequence without initial zero
with (combinat):seq(fibonacci(3, n^2)-1, n=0..33); # Zerinvary Lajos, May 25 2008

Range[0,100]^4 (* Vladimir Joseph Stephan Orlovsky, Mar 14 2011 *)

makelist(n^4,n,0,30); /* Martin Ettl, Nov 12 2012 */

A000583(n) = n^4 \\ Michael B. Porter, Nov 09 2009

def a(n): return n**4
print([a(n) for n in range(34)]) # Michael S. Branicky, Nov 10 2022

a(n) = A123865(n)+1 = A002523(n)-1.
Multiplicative with a(p^e) = p^(4e). - David W. Wilson, Aug 01 2001
G.f.: x*(1 + 11*x + 11*x^2 + x^3)/(1 - x)^5. More generally, g.f. for n^m is Euler(m, x)/(1-x)^(m+1), where Euler(m, x) is Eulerian polynomial of degree m (cf. A008292).
Dirichlet generating function: zeta(s-4). - Franklin T. Adams-Watters, Sep 11 2005
E.g.f.: (x + 7*x^2 + 6*x^3 + x^4)*e^x. More generally, the general form for the e.g.f. for n^m is phi_m(x)*e^x, where phi_m is the exponential polynomial of order n. - Franklin T. Adams-Watters, Sep 11 2005
Sum_{k>0} 1/a(k) = Pi^4/90 = A013662. - Jaume Oliver Lafont, Sep 20 2009
a(n) = C(n+3,4) + 11*C(n+2,4) + 11*C(n+1,4) + C(n,4). [Worpitzky's identity for powers of 4. See, e.g., Graham et al., eq. (6.37). - Wolfdieter Lang, Jul 17 2019]
a(n) = n*A177342(n) - Sum_{i=1..n-1} A177342(i) - (n - 1), with n > 1. - Bruno Berselli, May 07 2010
a(n) + a(n+1) + 1 = 2*A002061(n+1)^2. - Charlie Marion, Jun 13 2013
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + 24. - Ant King, Sep 23 2013
From Amiram Eldar, Jan 20 2021: (Start)
Sum_{n>=1} (-1)^(n+1)/a(n) = 7*Pi^4/720 (A267315).
Product_{n>=2} (1 - 1/a(n)) = sinh(Pi)/(4*Pi). (End)

A056468 a(n) = Sum_{k=1..n} k^6*binomial(n,k).

Original entry on oeis.org

0, 1, 66, 924, 7400, 44040, 217392, 942592, 3714048, 13593600, 46914560, 154328064, 487778304, 1490384896, 4423372800, 12801146880, 36235378688, 100580917248, 274361352192, 736775372800, 1950815354880, 5099601002496, 13176144920576, 33682341494784

Offset: 0

Benoit Cloitre, Dec 06 2002

Index entries for linear recurrences with constant coefficients, signature (14,-84,280,-560,672,-448,128).

Cf. A001788, A059338, A058649, A058645.

Table[Sum[k^6*Binomial[n, k], {k, n}], {n, 0, 30}] (* T. D. Noe, Nov 22 2013 *)

a(n) = sum(k = 1, n, k^6*binomial(n,k)); \\ Michel Marcus, Nov 20 2013

a(n) = 2^(n-6)*n*(n+1)*(n^4 + 14*n^3 + 31*n^2 - 46*n + 16).

G.f.: -x*(136*x^4-272*x^3+84*x^2+52*x+1)/(2*x-1)^7. [Colin Barker, Sep 20 2012]

A084641 Binomial transform of n^7.

Original entry on oeis.org

0, 1, 130, 2574, 25904, 183200, 1040112, 5076400, 22171648, 88915968, 333209600, 1181548544, 4001402880, 13033885696, 41061830656, 125666611200, 374947708928, 1093874155520, 3128047828992, 8785866391552, 24280799641600, 66124498599936, 177683966197760

Offset: 0

Paul Barry, Jun 08 2003

The binomial transforms of n, n^2, n^3, n^4, n^5, n^6 are A001787, A001788, A058645, A058649, A059338, A056468 respectively.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (16,-112,448,-1120,1792,-1792,1024,-256).

Cf. A001015, A001787, A001788, A058645, A058649, A059338, A056468.

[n^2*(n^5+21*n^4+105*n^3+35*n^2-210*n+112)*2^(n-7): n in [0..40]]; // G. C. Greubel, Mar 20 2023

LinearRecurrence[{16,-112,448,-1120,1792,-1792,1024,-256}, {0,1,130, 2574,25904,183200,1040112,5076400}, 41] (* Amiram Eldar, Nov 26 2021 *)

[n^2*(n^5+21*n^4+105*n^3+35*n^2-210*n+112)*2^(n-7) for n in range(41)] # G. C. Greubel, Mar 20 2023

a(n) = n^2*(n^5 + 21*n^4 + 105*n^3 + 35*n^2 - 210*n + 112)*2^(n-7).
a(n) = Sum_{k=0..n} C(n, k)*k^7.
G.f.: x*(1+114*x+606*x^2-1168*x^3-96*x^4+816*x^5-272*x^6)/(1-2*x)^8. - Colin Barker, Sep 20 2012

A084903 Binomial transform of positive cubes.

Original entry on oeis.org

1, 9, 44, 170, 576, 1792, 5248, 14688, 39680, 104192, 267264, 672256, 1662976, 4055040, 9764864, 23257088, 54853632, 128253952, 297533440, 685375488, 1568669696, 3569352704, 8078229504, 18192793600, 40785412096, 91049951232

Offset: 0

Paul Barry, Jun 13 2003

Index entries for linear recurrences with constant coefficients, signature (8,-24,32,-16).

Cf. A000578, A058645.

LinearRecurrence[{8,-24,32,-16},{1,9,44,170},30] (* Harvey P. Dale, Jul 30 2023 *)

a(n) = sum(k=0, n, binomial(n, k)*(1+k)^3); \\ Michel Marcus, Oct 13 2016

a(n) = 2^(n-3)*(n^3+9n^2+18n+8).
a(n) = Sum_{k=0..n} C(n, k)*(1+k)^3.
O.g.f.: (x-1)*(2*x^2-2*x-1)/(-1+2*x)^4. - R. J. Mathar, Apr 02 2008
a(n) = A058649(n+1)/n. [Gary Detlefs, Nov 26 2011]

A349706 Square array T(n,k) = Sum_{j=0..k} binomial(k,j) * j^n for n and k >= 0, read by ascending antidiagonals.

Original entry on oeis.org

1, 0, 2, 0, 1, 4, 0, 1, 4, 8, 0, 1, 6, 12, 16, 0, 1, 10, 24, 32, 32, 0, 1, 18, 54, 80, 80, 64, 0, 1, 34, 132, 224, 240, 192, 128, 0, 1, 66, 342, 680, 800, 672, 448, 256, 0, 1, 130, 924, 2192, 2880, 2592, 1792, 1024, 512, 0, 1, 258, 2574, 7400, 11000, 10752, 7840, 4608, 2304, 1024

Offset: 0

Michel Marcus, Nov 26 2021

			Square array begins:
  1 2  4   8   16    32
  0 1  4  12   32    80
  0 1  6  24   80   240
  0 1 10  54  224   800
  0 1 18 132  680  2880
  0 1 34 342 2192 11000

Seiichi Manyama, Antidiagonals n = 0..139, flattened
Renate Golombek, Aufgabe 1088, El. Math., 49 (1994), 126-127.
Simsek Yilmaz, New families of special numbers for computing negative order Euler numbers and related numbers and polynomials, Applicable Analysis and Discrete Mathematics 2018 Volume 12, Issue 1, Pages: 1-35. See B(n,k).

Rows n=0..7 give A000079, A001787, A001788, A058645, A058649, A059338, A056468, A084641.
Main diagonal gives A072034.
Cf. A209849.

T[n_, k_] := Sum[Binomial[k, j] * If[j == n == 0, 1, j^n], {j, 0, k}]; Table[T[n - k, k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, Nov 26 2021 *)

T(n,k) = sum(j=0, k, binomial(k,j)*j^n);

cp's OEIS Frontend

A000583 Fourth powers: a(n) = n^4.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Python

Formula

A056468 a(n) = Sum_{k=1..n} k^6*binomial(n,k).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A084641 Binomial transform of n^7.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A084903 Binomial transform of positive cubes.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A349706 Square array T(n,k) = Sum_{j=0..k} binomial(k,j) * j^n for n and k >= 0, read by ascending antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI