cp's OEIS Frontend

A057365 a(n) = floor(13*n/21).

%I A057365 #16 Sep 08 2022 08:45:02
%S A057365 0,0,1,1,2,3,3,4,4,5,6,6,7,8,8,9,9,10,11,11,12,13,13,14,14,15,16,16,
%T A057365 17,17,18,19,19,20,21,21,22,22,23,24,24,25,26,26,27,27,28,29,29,30,30,
%U A057365 31,32,32,33,34,34,35,35,36,37,37,38,39,39,40,40,41,42,42,43,43,44,45
%N A057365 a(n) = floor(13*n/21).
%C A057365 The cyclic pattern (and numerator of the gf) is computed using Euclid's algorithm for GCD.
%D A057365 N. Dershowitz and E. M. Reingold, Calendrical Calculations, Cambridge University Press, 1997.
%D A057365 R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, NY, 1994.
%H A057365 G. C. Greubel, <a href="/A057365/b057365.txt">Table of n, a(n) for n = 0..5000</a>
%H A057365 N. Dershowitz and E. M. Reingold, <a href="http://emr.cs.iit.edu/home/reingold/calendar-book/first-edition/">Calendrical Calculations Web Site</a>
%H A057365 <a href="/index/Rec#order_22">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,1,-1).
%F A057365 a(n) = a(n-1) + a(n-21) - a(n-22).
%F A057365 G.f.: x^2*(1 + x^2 + x^3 + x^5 + x^7 + x^8 + x^10 + x^11 + x^13 + x^15 + x^16 + x^18 + x^19)/( (1+x+x^2)*(x^6 + x^5 + x^4 + x^3 + x^2 + x + 1)*(x^12 - x^11 + x^9 - x^8 + x^6 - x^4 + x^3 - x + 1)*(x-1)^2 ). [Numerator corrected Feb 20 2011]
%t A057365 Table[Floor[13*n/21], {n,0,50}] (* _G. C. Greubel_, Nov 02 2017 *)
%o A057365 (PARI) 13*n\21 \\ _Charles R Greathouse IV_, Sep 02 2015
%o A057365 (Magma) [Floor(12*n/21): n in [0..50]]; // _G. C. Greubel_, Nov 02 2017
%Y A057365 Floors of other ratios: A004526, A002264, A002265, A004523, A057353, A057354, A057355, A057356, A057357, A057358, A057359, A057360, A057361, A057362, A057363, A057364, A057365, A057366, A057367.
%K A057365 nonn,easy
%O A057365 0,5
%A A057365 _Mitch Harris_