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 A079956 #16 Apr 16 2024 10:28:50
%S A079956 1,0,0,1,1,0,2,2,1,3,5,3,6,10,9,12,21,22,27,43,52,61,91,117,140,195,
%T A079956 260,318,426,572,718,939,1258,1608,2083,2769,3584,4630,6110,7961,
%U A079956 10297,13509,17655,22888,29916,39125,50840,66313,86696,112853,147069,192134
%N A079956 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,1,4}.
%C A079956 Number of compositions (ordered partitions) of n into elements of the set {3,4,6}.
%D A079956 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 A079956 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 A079956 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,1,0,1).
%F A079956 a(n) = a(n-3)+a(n-4)+a(n-6).
%F A079956 G.f.: -1/(x^6+x^4+x^3-1).
%t A079956 LinearRecurrence[{0,0,1,1,0,1},{1,0,0,1,1,0},60] (* _Harvey P. Dale_, Oct 05 2016 *)
%Y A079956 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079956 nonn,easy
%O A079956 0,7
%A A079956 _Vladimir Baltic_, Feb 19 2003