Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094094
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094094 Define x[1]...x[n] by the equations Sum_{j=1..n} x[j]^i = i, i=1..n; a(n) = n! * Sum_{j=1..n} x[j]^(n+1). +0
1
1, 5, 25, 139, 871, 6131, 48161, 419399, 4025071, 42359239, 486703009, 6081751259, 82345132871, 1203618149579, 18920122802881, 318578240878351, 5722495974697951, 109204791111380879, 2205128748183225281 (list; graph; listen)
OFFSET

1,2

COMMENT

Suggested by Example 2.24 in Lozansky and Rousseau. Hint: use Newton's equations.

REFERENCES

E. Lozansky and C. Rousseau, Winning Solutions, Springer, 1996; see p. 103.

FORMULA

E.g.f.: (1-exp(x/(x-1)))/(1-x)^2. - Vladeta Jovovic (vladeta(AT)Eunet.yu), May 03 2004

a(n) = n!*(n+1-LaguerreL(n,1,1)) = Sum_{k=1..n} (-1)^(k+1)*n!/k!*binomial(n+1,k+1). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 27 2006

CROSSREFS

Cf. A066668.

Adjacent sequences: A094091 A094092 A094093 this_sequence A094095 A094096 A094097

Sequence in context: A094602 A048370 A124891 this_sequence A081683 A122441 A064311

KEYWORD

nonn,easy

AUTHOR

njas, May 02 2004

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), May 03 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research