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 A060432 #76 May 24 2025 18:20:37
%S A060432 1,3,5,8,11,14,18,22,26,30,35,40,45,50,55,61,67,73,79,85,91,98,105,
%T A060432 112,119,126,133,140,148,156,164,172,180,188,196,204,213,222,231,240,
%U A060432 249,258,267,276,285,295,305,315,325,335,345,355,365,375,385,396,407,418
%N A060432 Partial sums of A002024.
%C A060432 In other words, first differences give A002024.
%C A060432 Equals A010054 convolved with [1, 2, 3, ...]. - _Gary W. Adamson_, Mar 16 2010
%H A060432 Harry J. Smith, <a href="/A060432/b060432.txt">Table of n, a(n) for n=1..1000</a>
%H A060432 Gorka Zamora-López and Romain Brasselet, <a href="https://arxiv.org/1810.12825">Sizing the length of complex networks</a>, arXiv:1810.12825 [physics.soc-ph], 2018.
%F A060432 Let f(n) = floor(1/2 + sqrt(2*n)), then this function is S(n) = f(1) + f(2) + f(3) + ... + f(n).
%F A060432 a(n) is asymptotic to c*n^(3/2) with c=0.9428.... - _Benoit Cloitre_, Dec 18 2002
%F A060432 a(n) is asymptotic to c*n^(3/2) with c = (2/3)*sqrt(2) = .942809.... - _Franklin T. Adams-Watters_, Sep 07 2006
%F A060432 Set R = round(sqrt(2*n)), then a(n) = ((6*n+1)*R-R^3)/6. - _Gerald Hillier_, Nov 28 2008
%F A060432 G.f.: W(0)/(2*(1-x)^2), where W(k) = 1 + 1/( 1 - x^(k+1)/( x^(k+1) + 1/W(k+1) )); (continued fraction). - _Sergei N. Gladkovskii_, Aug 21 2013
%F A060432 a(n) = A000330(A003056(n)) + (A003056(n) + 1) * (n - A057944(n)). This represents a closed form, because all of the constituent sequences (i.e., A003056, A000330, A057944) have a known closed form. - _Peter Kagey_, Jan 28 2016
%F A060432 G.f.: x^(7/8)*Theta_2(0,x^(1/2))/(2*(1-x)^2) where Theta_2 is a Jacobi theta function. - _Robert Israel_, Jan 28 2016
%F A060432 G.f.: (x/(1 - x)^2)*Product_{k>=1} (1 - x^(2*k))/(1 - x^(2*k-1)). - _Ilya Gutkovskiy_, May 30 2017
%F A060432 a(n) = n*(k+1)-k*(k+1)*(k+2)/6 where k = A003056(n) is the largest integer such that k*(k+1)/2 <= n. - _Bogdan Blaga_, Feb 04 2021
%e A060432 a(7) = 1 + 2 + 2 + 3 + 3 + 3 + 4 = 18.
%p A060432 ListTools:-PartialSums([seq(n$n,n=1..10)]); # _Robert Israel_, Jan 28 2016
%t A060432 a[n_] := Sum[Floor[1/2 + Sqrt[2*k]], {k, 1, n}]; Array[a, 60] (* _Jean-François Alcover_, Jan 10 2016 *)
%t A060432 Accumulate[Table[PadRight[{},n,n],{n,15}]//Flatten] (* _Harvey P. Dale_, May 24 2025 *)
%o A060432 (PARI) f(n) = floor(1/2+sqrt(2*n))
%o A060432 for(n=1,100,print1(sum(k=1,n,f(k)),","))
%o A060432 (PARI) { default(realprecision, 100); for (n=1, 1000, a=sum(k=1, n, floor(1/2 + sqrt(2*k))); write("b060432.txt", n, " ", a); ) } \\ _Harry J. Smith_, Jul 05 2009
%o A060432 (Haskell)
%o A060432 a060432 n = sum $ zipWith (*) [n,n-1..1] a010054_list
%o A060432 -- _Reinhard Zumkeller_, Dec 17 2011
%o A060432 (Python)
%o A060432 from math import isqrt
%o A060432 def A060432(n): return (k:=(r:=isqrt(m:=n+1<<1))+int((m<<2)>(r<<2)*(r+1)+1)-1)*(k*(-k - 3) + 6*n - 2)//6 + n # _Chai Wah Wu_, Oct 16 2022
%Y A060432 Cf. A002024, A006463, A010054.
%K A060432 easy,nonn
%O A060432 1,2
%A A060432 Robert A. Stump (bobess(AT)netzero.net), Apr 06 2001
%E A060432 More terms from _Jason Earls_, Jan 08 2002