login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001277 Number of permutations of length n by rises.
(Formerly M2928 N1176)
5
1, 3, 12, 56, 321, 2175, 17008, 150504, 1485465, 16170035, 192384876, 2483177808, 34554278857, 515620794591, 8212685046336, 139062777326000, 2494364438359953, 47245095998005059, 942259727190907180, 19737566982241851720, 433234326593362631601, 9943659797649140568863 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
REFERENCES
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 264.
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).
LINKS
FORMULA
Apparently a(n) = A173184(n)-1, partial sums of A000166. - Ralf Stephan, May 23 2004
a(n) = A136123(n,1). Emeric Deutsch and Vladeta Jovovic, Dec 17 2007
Conjecture: a(n) = A177265(n) if n even, = A177265(n)-1 if n odd. - R. J. Mathar, Jun 27 2022
Conjecture: D-finite with recurrence a(n) -n*a(n-1) +(n-1)*a(n-3)=0. - R. J. Mathar, Jul 01 2022
CROSSREFS
Cf. A173184.
Sequence in context: A009499 A009656 A020016 * A334773 A192525 A106570
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 19:29 EDT 2024. Contains 375044 sequences. (Running on oeis4.)