|
%I #33 Jul 30 2022 08:19:24
%S 0,0,3,7,14,23,34,46,61,78,97,118,141,165,192,221,252,285,320,357,396,
%T 436,479,524,571,620,671,724,779,836,895,955,1018,1083,1150,1219,1290,
%U 1363,1438,1515,1594,1675,1758,1842,1929,2018,2109,2202,2297,2394
%N a(n) = round(n^2 - sqrt(n)).
%H Vincenzo Librandi, <a href="/A213077/b213077.txt">Table of n, a(n) for n = 0..1000</a>
%e 0^2 - sqrt(0) = 0;
%e 1^2 - sqrt(1) = 0;
%e 2^2 - sqrt(2) = 3,
%e 3^2 - sqrt(3) = 7;
%e 4^2 - sqrt(4) = 14.
%p seq(round(n^2-sqrt(n)), n=0..100); # _Robert Israel_, Jul 29 2022
%t Table[Round[n^2 - Sqrt[n]], {n, 0, 100}] (* _T. D. Noe_, Jun 06 2012 *)
%o (Python)
%o count = 0
%o while count < 50:
%o ns = count * count
%o ns = ns - math.sqrt(count)
%o ns = round(ns)
%o print(ns, end=',')
%o count += 1
%o (Python)
%o from math import isqrt
%o def A213077(n): return n**2-(m:=isqrt(n))-int((n-m*(m+1)<<2)>=1) # _Chai Wah Wu_, Jul 29 2022
%Y Cf. A056847.
%K nonn
%O 0,3
%A _Ian Stewart_, Jun 04 2012
|
