cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A001280 Number of permutations of length n by rises.

This page as a plain text file.
%I A001280 M4811 N2058 #16 Jul 01 2022 07:30:34
%S A001280 11,309,5805,95575,1516785,24206055,396475975,6733084365,119143997490,
%T A001280 2201649739310,42514526708766,857750898213594,18068801884373310,
%U A001280 397038791150060850,9090755207499817170,216635190303090215910
%N A001280 Number of permutations of length n by rises.
%D A001280 F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 264.
%D A001280 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001280 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%F A001280 a(n) = A136123(n,4). - _Emeric Deutsch_ and _Vladet Jovovic_, Dec 17 2007
%F A001280 Conjecture: D-finite with recurrence (n-8)*(n-9)*a(n) -(n-9)*(n^2-6*n-2)*a(n-1) +(2*n^3-33*n^2+143*n-118)*a(n-2) +(5*n^2-27*n+16)*a(n-3) -2*(n-5)*(n-3)*(n-4)*a(n-4) +(n-5)*(n-3)*(n-4)*a(n-5)=0. - _R. J. Mathar_, Jul 01 2022
%K A001280 nonn
%O A001280 8,1
%A A001280 _N. J. A. Sloane_
%E A001280 More terms from _Vladeta Jovovic_, Nov 21 2007