cp's OEIS Frontend

A214393 Numbers of the form (4k+3)^2+4 or (4k+5)^2-8.

%I A214393 #29 Feb 22 2024 17:45:37
%S A214393 13,17,53,73,125,161,229,281,365,433,533,617,733,833,965,1081,1229,
%T A214393 1361,1525,1673,1853,2017,2213,2393,2605,2801,3029,3241,3485,3713,
%U A214393 3973,4217,4493,4753,5045,5321,5629,5921,6245,6553,6893,7217,7573,7913,8285,8641
%N A214393 Numbers of the form (4k+3)^2+4 or (4k+5)^2-8.
%C A214393 For every n=2k the triple (a(2k-1)^2, a(2k)^2 , a(2k+1)^2) is an arithmetic progression, i.e., 2*a(2k)^2 = a(2k-1)^2 + a(2k+1)^2.
%C A214393 In general a triple((x-y)^2,z^2,(x+y)^2) is an arithmetic progression if and only if x^2+y^2=z^2, e.g., (17^2, 53^2, 73^2).
%C A214393 The first differences of this sequence is the interleaved sequence 4,36,20,52,36,68,52,....
%H A214393 Paolo Xausa, <a href="/A214393/b214393.txt">Table of n, a(n) for n = 0..10000</a>
%H A214393 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-2,1).
%F A214393 a(n) = 2*a(n-1)-2*a(n-3)+a(n-4).
%F A214393 G.f.: (13-9*x+19*x^2-7*x^3)/((1+x)*(1-x)^3).
%F A214393 a(n) = 4*n*(n+3)+6*(-1)^n+7.
%F A214393 2*a(2n)^2 = a(2n-1)^2 + a(2n+1)^2.
%e A214393 a(5) = 2*a(4) - 2*a(2) + a(1) = 2*125 - 2*53 + 17 = 161.
%t A214393 A214393[n_] := 4*n*(n+3) + 6*(-1)^n + 7; Array[A214393, 50, 0] (* or *)
%t A214393 LinearRecurrence[{2, 0, -2, 1}, {13, 17, 53, 73}, 50] (* _Paolo Xausa_, Feb 22 2024 *)
%o A214393 (Magma) I:=[13, 17, 53, 73]; [n le 4 select I[n] else 2*Self(n-1)-2*Self(n-3)+Self(n-4): n in [1..75]];
%o A214393 (Maxima) A214393(n):=4*n*(n+3)+6*(-1)^n+7$
%o A214393 makelist(A214393(n),n,0,30); /* _Martin Ettl_, Nov 01 2012 */
%Y A214393 Cf. A178218, A214345.
%K A214393 nonn,easy
%O A214393 0,1
%A A214393 _Yasir Karamelghani Gasmallah_, Jul 15 2012