Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006231
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006231 Sum_{k=2..n} n(n-1)...(n-k+1)/k.
(Formerly M3908)
+0
7
0, 1, 5, 20, 84, 409, 2365, 16064, 125664, 1112073, 10976173, 119481284, 1421542628, 18348340113, 255323504917, 3809950976992, 60683990530208, 1027542662934897, 18430998766219317, 349096664728623316 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n) is also the number of permutations in the symmetric group S_n that are pure cycles - Avi Peretz (njk(AT)netvision.net.il), Mar 24 2001

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=1..100

EXAMPLE

a(3) = 5 because the cycles in S_3 are (12), (13), (23), (123), (132).

CROSSREFS

Differences satisfy a(n+1)-a(n)=A000522(n)-1.

Cf. A059760.

Sequence in context: A006749 A002213 A099949 this_sequence A069007 A126987 A152185

Adjacent sequences: A006228 A006229 A006230 this_sequence A006232 A006233 A006234

KEYWORD

nonn,easy,nice

AUTHOR

R. K. Guy

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Mar 27 2001

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research