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 A135804 #14 Nov 11 2016 21:49:17
%S A135804 1,0,0,84,210,3696,33264,392964,4879875,66106040,963266304,
%T A135804 15032793048,250055167908,4415595820608,82483140014880,
%U A135804 1624829831302104,33659674920420549,731455984834451184,16636624374027720832
%N A135804 Seventh column (k=6) of triangle A134832 (circular succession numbers).
%C A135804 a(n) enumerates circular permutations of {1,2,...,n+6} with exactly six successor pairs (i,i+1). Due to cyclicity also (n+6,1) is a successor pair.
%D A135804 Ch. A. Charalambides, Enumerative Combinatorics, Chapman & Hall/CRC, Boca Raton, Florida, 2002, p. 183, eq. (5.15), for k=6.
%H A135804 G. C. Greubel, <a href="/A135804/b135804.txt">Table of n, a(n) for n = 0..444</a>
%F A135804 a(n) = binomial(n+6,6)*A000757(n), n>=0.
%F A135804 E.g.f.: (d^6/dx^6) (x^6/6!)*(1-log(1-x))/e^x.
%e A135804 a(0)=1 because from the 6!/6 = 120 circular permutations of n=6 elements only one, namely (1,2,3,4,5,6), has six successors.
%t A135804 f[n_] := (-1)^n + Sum[(-1)^k*n!/((n - k)*k!), {k, 0, n - 1}]; a[n_, n_] = 1; a[n_, 0] := f[n]; a[n_, k_] := a[n, k] = n/k*a[n - 1, k - 1]; Table[a[n, 6], {n, 6, 25}] (* _G. C. Greubel_, Nov 10 2016 *)
%Y A135804 Cf. A135803 (column k=5), A135805 (column k=7).
%K A135804 nonn,easy
%O A135804 0,4
%A A135804 _Wolfdieter Lang_, Jan 21 2008