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!)
A001278 Number of permutations of length n by rises.
(Formerly M4799 N2050)
2

%I M4799 N2050 #17 Jul 01 2022 06:46:07

%S 1,11,87,693,5934,55674,572650,6429470,78366855,1031378445,

%T 14583751161,220562730171,3553474061452,60765835154948,

%U 1099353888345924,20980355229808524,421242574828254525,8876636475162819615,195887449298481357835,4517865858233007694865,108699311713253202373146,2723633081926998772488606

%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,2). _Emeric Deutsch_ and _Vladeta Jovovic_, Dec 17 2007

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

%K nonn

%O 4,2

%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 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)