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 A342696 #13 Oct 29 2022 22:19:07 %S A342696 0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2, %T A342696 2,2,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5, %U A342696 5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,8 %N A342696 a(n) = floor(n/12). %C A342696 Agrees with A064459 for n < 144, but a(144) = 12 whereas A064459(144) = 13. %H A342696 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1). %F A342696 G.f.: x^12 / ( (1+x)*(1+x^2)*(x^4-x^2+1)*(x^2-x+1)*(1+x+x^2)*(x-1)^2 ). - _R. J. Mathar_, Jul 08 2021 %F A342696 a(n) = a(n-1) + a(n-12) - a(n-13). - _Wesley Ivan Hurt_, Oct 29 2022 %t A342696 Floor[Range[0, 200]/12] %Y A342696 Cf. A064459, A221912 (partial sums), A344420 (floor n/11). %K A342696 nonn,easy %O A342696 0,25 %A A342696 _Wesley Ivan Hurt_, May 18 2021