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 A327440 #19 May 13 2024 13:47:34
%S A327440 0,0,0,0,1,1,1,2,2,2,3,3,3,3,4,4,4,5,5,5,6,6,6,6,7,7,7,8,8,8,9,9,9,9,
%T A327440 10,10,10,11,11,11,12,12,12,12,13,13,13,14,14,14,15,15,15,15,16,16,16,
%U A327440 17,17,17,18,18,18,18,19,19,19,20,20,20,21,21,21,21,22,22,22,23
%N A327440 a(n) = floor(3*n/10).
%C A327440 The sequence can be obtained from A008585 by deleting the last digit of each term.
%H A327440 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,1,-1).
%F A327440 O.g.f.: x^4*(1 + x^3 + x^6)/((1 + x)*(1 - x)^2*(1 - x + x^2 - x^3 + x^4)*(1 + x + x^2 + x^3 + x^4)) = (x^4 + x^7 + x^10)/(1 - x - x^10 + x^11).
%F A327440 a(n) = a(n-1) + a(n-10) - a(n-11) for n > 10.
%t A327440 Table[Floor[3 n/10], {n, 0, 80}]
%t A327440 LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1}, {0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3}, 80]
%o A327440 (Julia) [div(3*n, 10) for n in 0:80] |> println
%o A327440 (PARI) vector(80, n, n--; floor(3*n/10))
%Y A327440 Cf. A008585.
%Y A327440 Similar sequences with the formula floor(k*n/10): A059995 (k=1); A002266 (k=2); A057354 (k=4); A004526 (k=5); A057355 (k=6); A188511 (k=7); A090223 (k=8).
%K A327440 nonn,easy
%O A327440 0,8
%A A327440 _Bruno Berselli_, Sep 11 2019