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

%I M2928 N1176 #23 Jul 01 2022 06:40:58

%S 1,3,12,56,321,2175,17008,150504,1485465,16170035,192384876,

%T 2483177808,34554278857,515620794591,8212685046336,139062777326000,

%U 2494364438359953,47245095998005059,942259727190907180,19737566982241851720,433234326593362631601,9943659797649140568863

%N Number of permutations of length n by rises.

%D F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 264.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%F Apparently a(n) = A173184(n)-1, partial sums of A000166. - _Ralf Stephan_, May 23 2004

%F a(n) = A136123(n,1). _Emeric Deutsch_ and _Vladeta Jovovic_, Dec 17 2007

%F Conjecture: a(n) = A177265(n) if n even, = A177265(n)-1 if n odd. - _R. J. Mathar_, Jun 27 2022

%F Conjecture: D-finite with recurrence a(n) -n*a(n-1) +(n-1)*a(n-3)=0. - _R. J. Mathar_, Jul 01 2022

%Y Cf. A173184.

%K nonn

%O 2,2

%A _N. J. A. Sloane_

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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)