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 A079965 #18 Apr 16 2024 10:34:52
%S A079965 1,0,1,1,1,3,3,5,8,10,17,24,35,54,77,116,172,252,377,555,822,1220,
%T A079965 1801,2671,3953,5849,8666,12823,18987,28113,41612,61615,91214,135037,
%U A079965 199929,295976,438193,648734,960420,1421893,2105059,3116482,4613879,6830695
%N A079965 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={0,3}.
%C A079965 Number of compositions (ordered partitions) of n into elements of the set {2,3,5,6}.
%D A079965 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 A079965 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 A079965 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1,0,1,1).
%F A079965 a(n) = a(n-2)+a(n-3)+a(n-5)+a(n-6).
%F A079965 G.f.: -1/(x^6+x^5+x^3+x^2-1).
%t A079965 LinearRecurrence[{0,1,1,0,1,1},{1,0,1,1,1,3},50] (* _Harvey P. Dale_, Jul 10 2017 *)
%Y A079965 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079965 nonn,easy
%O A079965 0,6
%A A079965 _Vladimir Baltic_, Feb 19 2003