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 A131477 #20 Nov 05 2024 09:33:26 %S A131477 0,1,3,9,22,42,72,115,171,243,334,444,576,733,915,1125,1366,1638,1944, %T A131477 2287,2667,3087,3550,4056,4608,5209,5859,6561,7318,8130,9000,9931, %U A131477 10923,11979,13102,14292,15552,16885,18291,19773,21334,22974 %N A131477 a(n) = ceiling(n^3/3). %H A131477 Vincenzo Librandi, <a href="/A131477/b131477.txt">Table of n, a(n) for n = 0..10000</a> %H A131477 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (3, -3, 2, -3, 3, -1). %F A131477 From _R. J. Mathar_, Dec 19 2008: (Start) %F A131477 G.f.: x*(1 + 3*x^2 + 2*x^3)/((1 - x)^4*(1 + x + x^2)). %F A131477 a(n) = (A001093(n) - A049347(n))/3. (End) %F A131477 a(n) = floor(n^3/3 + 2/3). - _Bruno Berselli_, Dec 21 2017 %t A131477 Ceiling[Range[0,50]^3/3] (* _Harvey P. Dale_, Oct 19 2013 *) %o A131477 (Magma) [Ceiling(n^3/3) : n in [0..50]]; // _Vincenzo Librandi_, Oct 01 2011 %Y A131477 Cf. A000982, A008619, A004526, A007590, A036487. %K A131477 nonn,easy %O A131477 0,3 %A A131477 _Mohammad K. Azarian_, Jul 27 2007