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.
%I A001277 M2928 N1176 #23 Jul 01 2022 06:40:58 %S A001277 1,3,12,56,321,2175,17008,150504,1485465,16170035,192384876, %T A001277 2483177808,34554278857,515620794591,8212685046336,139062777326000, %U A001277 2494364438359953,47245095998005059,942259727190907180,19737566982241851720,433234326593362631601,9943659797649140568863 %N A001277 Number of permutations of length n by rises. %D A001277 F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 264. %D A001277 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001277 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %F A001277 Apparently a(n) = A173184(n)-1, partial sums of A000166. - _Ralf Stephan_, May 23 2004 %F A001277 a(n) = A136123(n,1). _Emeric Deutsch_ and _Vladeta Jovovic_, Dec 17 2007 %F A001277 Conjecture: a(n) = A177265(n) if n even, = A177265(n)-1 if n odd. - _R. J. Mathar_, Jun 27 2022 %F A001277 Conjecture: D-finite with recurrence a(n) -n*a(n-1) +(n-1)*a(n-3)=0. - _R. J. Mathar_, Jul 01 2022 %Y A001277 Cf. A173184. %K A001277 nonn %O A001277 2,2 %A A001277 _N. J. A. Sloane_