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 A079958 #23 Jun 21 2024 16:55:46
%S A079958 1,1,2,4,7,13,25,46,86,161,300,560,1046,1952,3644,6803,12699,23706,
%T A079958 44254,82611,154215,287883,537408,1003212,1872757,3495988,6526172,
%U A079958 12182800,22742368,42454552,79252477,147945385,276178586,515559248
%N A079958 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={3,4}.
%C A079958 Number of compositions (ordered partitions) of n into elements of the set {1,2,3,6}.
%C A079958 Number of compositions of n with 3 frozen; that is, the order of the summand 3 does not matter. - _Gregory L. Simay_, Oct 01 2018
%D A079958 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 A079958 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 A079958 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,0,0,1).
%F A079958 a(n) = a(n-1)+a(n-2)+a(n-3)+a(n-6).
%F A079958 G.f.: -1/(x^6+x^3+x^2+x-1)
%t A079958 LinearRecurrence[{1,1,1,0,0,1},{1,1,2,4,7,13},40] (* _Harvey P. Dale_, Jun 21 2024 *)
%o A079958 (PARI) x='x+O('x^50); Vec(1/(1-x-x^2-x^3-x^6)) \\ _Altug Alkan_, Oct 02 2018
%Y A079958 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079958 nonn
%O A079958 0,3
%A A079958 _Vladimir Baltic_, Feb 19 2003