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 A106232 #37 Mar 05 2023 10:10:52
%S A106232 4,4,12,24,40,60,84,112,144,180,220,264,312,364,420,480,544,612,684,
%T A106232 760,840,924,1012,1104,1200,1300,1404,1512,1624,1740,1860,1984,2112,
%U A106232 2244,2380,2520,2664,2812,2964,3120,3280,3444,3612,3784,3960,4140,4324,4512
%N A106232 Least k > 0 such that (4*n^2 + 2)*(k^2) + (4*n^2 + 2)*k + 1 = j^2.
%C A106232 For k there is always a recurrence.
%C A106232 For n=1, k(1,1) = 0, k(2,1) = 4 then k(i,1) = 10*k(i-1,1) + 4 - k(i-3,n).
%C A106232 For n>1, k(1,n) = 0, k(2,n) = 2*n^2 - 2*n, k(3,n) = 2*n^2 + 2*n, k(4,n) = (8*n^2+2)*k(2,n) + 4*n^2 then k(i,n) = (8*n^2+2)*k(i-2,n) + 4*n^2 - k(i-4,n).
%H A106232 Stefano Spezia, <a href="/A106232/b106232.txt">Table of n, a(n) for n = 1..10000</a>
%H A106232 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A106232 a(1) = 4, a(n) = 2*n^2 - 2*n for n > 1, j sequence = A106231.
%F A106232 a(n) = A046092(n-1), n > 1. - _R. J. Mathar_, Aug 28 2008
%F A106232 G.f.: 4*x*(x^3 - 3*x^2 + 2*x - 1)/(x - 1)^3. - _Colin Barker_, Mar 06 2013
%F A106232 E.g.f.: 4*x + 2*x^2*exp(x). - _Stefano Spezia_, Jun 06 2021
%t A106232 LinearRecurrence[{3,-3,1},{4,4,12,24},50] (* _Harvey P. Dale_, Mar 05 2023 *)
%o A106232 (Magma) [4] cat [2*n*(n+1): n in [1..50]]; // _Vincenzo Librandi_, Apr 06 2020
%o A106232 (PARI) a(n) = if(n==1, 4, 2*n^2-2*n); \\ _Jinyuan Wang_, Apr 07 2020
%Y A106232 Cf. A046092, A106231.
%K A106232 nonn,easy
%O A106232 1,1
%A A106232 _Pierre CAMI_, Apr 26 2005
%E A106232 More terms from _Colin Barker_, Mar 06 2013