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!)
A001279 Number of permutations of length n by rises.
(Formerly M3159 N1279)
2

%I M3159 N1279 #16 Jul 01 2022 06:50:22

%S 3,53,680,8064,96370,1200070,15778800,220047400,3257228485,

%T 51125192475,849388162448,14905775547488,275697902983860,

%U 5362979000259804,109488815508733440,2341353038132316240,52346701837709016375,1221458048752142672625,29697803502485749344120,751211166036942984639200

%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 a(n) = A136123(n,3). - _Emeric Deutsch_ and _Vladeta Jovovic_, Dec 17 2007

%F Conjecture D-finite with recurrence 3*(-n+6)*a(n) +(3*n^2-23*n+67)*a(n-1) +(5*n^2-58*n+179)*a(n-2) +(n^2-51*n+128)*a(n-3) +(-17*n^2+183*n-364)*a(n-4) -4*(n-4)*(n-11)*a(n-5) +12*(n-4)*(n-5)*a(n-6)=0. - _R. J. Mathar_, Jul 01 2022

%K nonn

%O 6,1

%A _N. J. A. Sloane_

%E More terms from _Vladeta Jovovic_, Nov 21 2007

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 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)