Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Oct 11 2020 13:21:28
%S 0,0,1,2,3,4,6,8,11,14,17,20,24,28,33,38,43,48,54,60,67,74,81,88,96,
%T 104,113,122,131,140,150,160,171,182,193,204,216,228,241,254,267,280,
%U 294,308,323,338,353,368,384,400,417,434,451,468,486,504
%N Nearest integer to n^2/6.
%H Harvey P. Dale, <a href="/A056829/b056829.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,0,0,1,-2,1).
%F G.f.: -x^2*(1+x^4) / ( (1+x)*(1+x+x^2)*(x^2-x+1)*(x-1)^3 ). - _R. J. Mathar_, Jul 10 2015
%F a(n) = A056827(n)+A088911(n+3). - _R. J. Mathar_, Jul 10 2015
%t Round[Range[0,60]^2/6] (* or *) LinearRecurrence[{2,-1,0,0,0,1,-2,1},{0,0,1,2,3,4,6,8},60] (* _Harvey P. Dale_, Oct 11 2020 *)
%K nonn,easy
%O 0,4
%A _N. J. A. Sloane_, Sep 02 2000