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 A079960 #25 Apr 16 2024 04:14:42
%S A079960 1,1,2,3,5,9,16,28,49,85,148,258,450,785,1369,2387,4162,7257,12654,
%T A079960 22065,38475,67089,116983,203983,355685,620208,1081457,1885737,
%U A079960 3288160,5733565,9997618,17432848,30397660,53004405,92423790,161159378
%N A079960 Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={2,3}.
%C A079960 Number of compositions (ordered partitions) of n into elements of the set {1,2,5,6}.
%D A079960 D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.
%H A079960 Vladimir Baltic, <a href="http://pefmath.etf.rs/vol4num1/AADM-Vol4-No1-119-135.pdf">On the number of certain types of strongly restricted permutations</a>, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135.
%H A079960 Milan Janjic, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/Janjic/janjic73.html">Binomial Coefficients and Enumeration of Restricted Words</a>, Journal of Integer Sequences, 2016, Vol 19, #16.7.3.
%H A079960 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,1,1).
%F A079960 a(n) = a(n-1) + a(n-2) + a(n-5) + a(n-6).
%F A079960 G.f.: -1/(x^6 + x^5 + x^2 + x - 1).
%p A079960 g:=1/(1-z-z^2-z^5-z^6): gser:=series(g, z=0, 49): seq((coeff(gser, z, n)), n=0..35); # _Zerinvary Lajos_, Apr 17 2009
%Y A079960 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079960 nonn,easy
%O A079960 0,3
%A A079960 _Vladimir Baltic_, Feb 19 2003