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.

A000506 One half of the number of permutations of [n] such that the differences have 5 runs with the same signs.

This page as a plain text file.
%I A000506 M5322 N2313 #24 Jan 05 2022 00:31:13
%S A000506 61,841,7311,51663,325446,1910706,10715506,58258210,309958755,
%T A000506 1623847695,8412276585,43220104041,220683627988,1121561317408,
%U A000506 5679711010548,28683869195556,144552802373145,727271783033445
%N A000506 One half of the number of permutations of [n] such that the differences have 5 runs with the same signs.
%D A000506 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 260, #13
%D A000506 F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 260.
%D A000506 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000506 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%F A000506 Limit_{n->infinity} 16*a(n)/5^n = 1. - _Philippe Deléham_, Feb 22 2004
%t A000506 p[n_ /; n >= 2, 1] = 2; p[n_ /; n >= 2, k_] /; 1 <= k <= n := p[n, k] = k*p[n-1, k] + 2*p[n-1, k-1] + (n-k)*p[n-1, k-2]; p[n_, k_] = 0; t[n_, k_] := p[n, k]/2; a[n_] := t[n, 5]; Table[a[n], {n, 6, 23}] (* _Jean-François Alcover_, Feb 09 2016 *)
%Y A000506 A diagonal of A008970.
%K A000506 nonn,easy
%O A000506 6,1
%A A000506 _N. J. A. Sloane_
%E A000506 More terms from _Emeric Deutsch_, Feb 21 2004