OFFSET
0,6
COMMENTS
Previous name: Differences of 0; labeled ordered partitions into 5 parts.
Number of surjections from an n-element set onto a five-element set, with n >= 5. - Mohamed Bouhamida, Dec 15 2007
For n > 0, the number of rows of n colors using exactly five colors. For n=5, the 120 rows are the 120 permutations of ABCDE. - Robert A. Russell, Sep 25 2018
REFERENCES
H. T. Davis, Tables of the Mathematical Functions. Vols. 1 and 2, 2nd ed., 1963, Vol. 3 (with V. J. Fisher), 1962; Principia Press of Trinity Univ., San Antonio, TX, Vol. 2, p. 212.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 33.
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).
J. F. Steffensen, Interpolation, 2nd ed., Chelsea, NY, 1950, see p. 54.
A. H. Voigt, Theorie der Zahlenreihen und der Reihengleichungen, Goschen, Leipzig, 1911, p. 31.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
K. S. Immink, Coding Schemes for Multi-Level Channels that are Intrinsically Resistant Against Unknown Gain and/or Offset Using Reference Symbols, 2013.
P. A. Piza, Kummer numbers, Mathematics Magazine, 21 (1947/1948), 257-260.
P. A. Piza, Kummer numbers, Mathematics Magazine, 21 (1947/1948), 257-260. [Annotated scanned copy]
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
A. H. Voigt, Theorie der Zahlenreihen und der Reihengleichungen, Leipzig, 1911.
A. H. Voigt, Theorie der Zahlenreihen und der Reihengleichungen, Goschen, Leipzig, 1911. [Annotated scans of pages 30-33 only]
Index entries for linear recurrences with constant coefficients, signature (15, -85, 225, -274, 120).
FORMULA
a(n) = Sum_{i=0..4} (-1)^i*binomial(5, i)*(5-i)^n.
a(n) = [n=0] + 5!*S(n, 5).
E.g.f.: 1 + (e^x-1)^5.
a(n) = 5^n - C(5,4)*4^n + C(5,3)*3^n - C(5,2)*2^n + C(5,1). - Mohamed Bouhamida, Dec 15 2007
G.f.: (-274*x^4 + 225*x^3 - 85*x^2 + 15*x - 1)/((x-1)*(4*x-1)*(3*x-1)*(2*x-1)*(5*x-1)). - Maksym Voznyy (voznyy(AT)mail.ru), Jul 26 2009
MAPLE
A001118:=-120/(z-1)/(4*z-1)/(3*z-1)/(2*z-1)/(5*z-1); # Conjectured (correctly) by Simon Plouffe in his 1992 dissertation. Gives sequence except for 5 leading terms.
MATHEMATICA
CoefficientList[Series[(-1-274*x^4+225*x^3-85*x^2+15*x)/((x-1)*(4*x-1)*(3*x-1)*(2*x-1)*(5*x-1)), {x, 0, 30}], x] (* Vincenzo Librandi, Apr 11 2012 *)
k=5; Prepend[Table[k!StirlingS2[n, k], {n, 1, 30}], 1] (* Robert A. Russell, Sep 25 2018 *)
PROG
(PARI) a(n) = sum(i=0, 4, (-1)^i*binomial(5, i)*(5-i)^n); \\ Altug Alkan, Dec 04 2015
(PARI) Vec((-274*x^4 + 225*x^3 - 85*x^2 + 15*x - 1)/((x-1)*(4*x-1)*(3*x-1)*(2*x-1)*(5*x-1))+O(x^30)) \\ Stefano Spezia, Oct 16 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Extended with formula and alternate description by Christian G. Bower, Aug 15 1998
Name edited by Harry Richman, Mar 31 2023
STATUS
approved