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 A036408 #14 Jul 04 2019 15:26:23
%S A036408 0,1,1,1,2,3,4,5,7,9,10,13,15,17,20,23,26,29,33,37,40,45,49,53,58,63,
%T A036408 68,73,79,85,90,97,103,109,116,123,130,137,145,153,160,169,177,185,
%U A036408 194,203,212,221,231,241,250,261,271,281,292,303,314,325
%N A036408 a(n) = ceiling(n^2/10).
%H A036408 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1, 0, 0, 0, 0, 0, 0, 0, 1, -2, 1).
%F A036408 From _R. J. Mathar_, Jan 22 2011: (Start)
%F A036408 a(n) = 2*a(n-1) - a(n-2) + a(n-10) - 2*a(n-11) + a(n-12).
%F A036408 G.f.: -x*(1 - x + x^7 - x^9 + x^10 + x^3) / ( (1+x)*(x^4 + x^3 + x^2 + x + 1)*(x^4 - x^3 + x^2 - x + 1)*(x-1)^3 ). (End)
%e A036408 a(6) = ceiling(6^2/10) = ceiling(3.6) = 4.
%p A036408 A036408:=n->ceil(n^2/10); seq(A036408(k), k=0..100); # _Wesley Ivan Hurt_, Nov 06 2013
%t A036408 Table[Ceiling[n^2/10], {n,0,100}] (* _Wesley Ivan Hurt_, Nov 06 2013 *)
%t A036408 LinearRecurrence[{2,-1,0,0,0,0,0,0,0,1,-2,1},{0,1,1,1,2,3,4,5,7,9,10,13},60] (* _Harvey P. Dale_, Sep 27 2016 *)
%K A036408 nonn
%O A036408 0,5
%A A036408 _N. J. A. Sloane_