A200658 a(n) = A200656(n)^3 - A200657(n)^2.
52488, 15336, -20088, 219375, -293625, 981504, -1285632, -474552, 1367631
Offset: 1
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.
A077118(10)=1024=32^2 is the nearest square to 10^3=1000, therefore a(10)=1024-1000=24.
[Round(Sqrt(n^3))^2-n^3: n in [0..60]]; // Vincenzo Librandi, Mar 24 2015
A077119 := proc(n) (round( sqrt(n^3) ))^2-n^3 ; end proc: # R. J. Mathar, Jan 18 2021
Table[Round[Sqrt[x^3]]^2 - x^3, {x, 0, 100}] (* Artur Jasinski, Nov 30 2011 *)
from math import isqrt def A077119(n): return ((m:=isqrt(k:=n**3))+int((k-m*(m+1)<<2)>=1))**2-k # Chai Wah Wu, Jul 29 2022
a(3)=2878=A200656(1) because 2878^3-154396^2=15336. G.f. = 22 + 190*x + 2868*x^2 + 3862*x^3 + 111382*x^4 + 117118*x^5 + ... - _Michael Somos_, Aug 23 2018
m:=30; R:=PowerSeriesRing(Integers(), m); Coefficients(R!(2*(11+84*z+904*z^2-2868*z^3+492*z^5 -12*z^7 +2266*z^4 -440*z^6 +11*z^8)/((1-z)*(z^2+6*z+1)*(1-6*z+z^2)*(z^2+2*z-1)*(z^2-2*z-1)))); // G. C. Greubel, Jul 27 2018
aa = {22, 190, 2878, 3862, 111382, 117118, 3864190, 3897622, 131738902}; a1 = aa[[1]]; a2 = aa[[3]]; a3 = aa[[3]]; a4 = aa[[4]]; a5 = aa[[5]]; a6 = aa[[6]]; a7 = aa[[7]]; a8 = aa[[8]]; a9 = aa[[9]]; Do[an = a9 + 40*a8 - 40*a7 - 206*a6 + 206*a5 + 40*a4 - 40*a3 - a2 + a1; a1 = a2; a2 = a3; a3 = a4; a4 = a5; a5 = a6; a6 = a7; a7 = a8; a8 = a9; a9 = an; AppendTo[aa, an], {nn, 20}]; aa CoefficientList[Series[-2*(11 + 84*z + 904*z^2 - 2868*z^3 + 492*z^5 - 12*z^7 + 2266*z^4 - 440*z^6 + 11*z^8)/((z - 1) (z^2 + 6*z + 1) (1 - 6*z + z^2) (z^2 + 2*z - 1) (z^2 - 2*z - 1)), {z, 0, 30}], z] (* G. C. Greubel, Jul 27 2018 *) a[ n_] := With[{m = Max[-5 - n, n]}, SeriesCoefficient[ 2 (1 - 12 x - 40 x^2 + 396 x^3 - 1138 x^4 + 396 x^5 - 40 x^6 - 12 x^7 + x^8) / (x^2 (x - 1) (1 + 6 x + x^2) (1 - 6 x + x^2) (x^2 + 2 x - 1) (x^2 - 2 x - 1)), {x, 0, m}]]; (* Michael Somos, Aug 23 2018 *) a[ n_] := With[ {m = If[ OddQ[n], -5 - n, n], r1 = 1 + Sqrt[2], r2 = 1 - Sqrt[2]}, Simplify[7 - 6 (6 r1 + r2) r1^m - 6 (r1 + 6 r2) r2^m + (169 r1 + 29 r2)/4 r1^(2 m) + (29 r1 + 169 r2)/4 r2^(2 m)]]; (* Michael Somos, Aug 25 2018 *)
z='z+O('z^30); Vec(2*(11+84*z+904*z^2-2868*z^3+492*z^5 -12*z^7 +2266*z^4 -440*z^6 +11*z^8)/((1-z)*(z^2+6*z+1)*(1-6*z+z^2)*(z^2+2*z-1)*(z^2-2*z-1))) \\ G. C. Greubel, Jul 27 2018
{a(n) = my(m = max(-5-n, n)); polcoeff( 2*(1 - 12*x - 40*x^2 + 396*x^3 - 1138*x^4 + 396*x^5 - 40*x^6 - 12*x^7 + x^8) / (x^2*(x - 1)*(1 + 6*x + x^2)*(1 - 6*x + x^2)*(x^2 + 2*x - 1)*(x^2 - 2*x - 1)) + x * O(x^m), m)}; /* Michael Somos, Aug 23 2018 */
{a(n) = my(m = if(n%2, -5-n, n), r1 = 1 + quadgen(8), r2 = 1 - quadgen(8)); simplify(7 - 6*(6*r1 + r2) * r1^m - 6*(r1 + 6*r2) * r2^m + (169*r1 + 29*r2)/4 * r1^(2*m) + (29*r1 + 169*r2)/4 * r2^(2*m))}; /* Michael Somos, Aug 25 2018 */
LinearRecurrence[{341,-6138,6138,-341,1},{6100,2305180,748476100,241118603980,77641444770100},20] (* Harvey P. Dale, Aug 17 2016 *)
Comments