# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a079816 Showing 1-1 of 1 %I A079816 #27 Dec 13 2023 08:32:10 %S A079816 1,1,1,2,4,7,12,20,34,59,102,175,300,515,885,1521,2613,4488,7709, %T A079816 13243,22750,39081,67134,115324,198107,340315,584604,1004250,1725130, %U A079816 2963480,5090756,8745055,15022519,25806135,44330556,76152366,130816831 %N A079816 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={1}. %C A079816 Number of compositions (ordered partitions) of n into elements of the set {1,3,4,5,6}. %C A079816 a(n+1) is the number of multus bitstrings of length n with no runs of 6 ones. - _Steven Finch_, Mar 25 2020 %D A079816 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 A079816 G. C. Greubel, Table of n, a(n) for n = 0..1000 %H A079816 Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135 %H A079816 Steven Finch, Cantor-solus and Cantor-multus distributions, arXiv:2003.09458 [math.CO], 2020. %H A079816 Index entries for linear recurrences with constant coefficients, signature (1,0,1,1,1,1). %F A079816 Recurrence: a(n) = a(n-1) + a(n-3) + a(n-4) + a(n-5) + a(n-6). %F A079816 G.f.: 1/(1-x-x^3-x^4-x^5-x^6). %t A079816 LinearRecurrence[{1,0,1,1,1,1}, {1,1,1,2,4,7}, 51] (* _G. C. Greubel_, Dec 12 2023 *) %o A079816 (Magma) R:=PowerSeriesRing(Integers(), 50); Coefficients(R!( 1/(1-x-x^3-x^4-x^5-x^6) )); // _G. C. Greubel_, Dec 12 2023 %o A079816 (SageMath) %o A079816 def A079816_list(prec): %o A079816 P. = PowerSeriesRing(ZZ, prec) %o A079816 return P( 1/(1-x-x^3-x^4-x^5-x^6) ).list() %o A079816 A079816_list(50) # _G. C. Greubel_, Dec 12 2023 %Y A079816 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014. %K A079816 nonn %O A079816 0,4 %A A079816 _Vladimir Baltic_, Feb 19 2003 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE