login
a(n) = lcm(8,n)/gcd(8,n).
3

%I #16 Oct 07 2023 05:06:14

%S 8,4,24,2,40,12,56,1,72,20,88,6,104,28,120,2,136,36,152,10,168,44,184,

%T 3,200,52,216,14,232,60,248,4,264,68,280,18,296,76,312,5,328,84,344,

%U 22,360,92,376,6,392,100,408,26,424,108,440,7,456,116,472,30,488

%N a(n) = lcm(8,n)/gcd(8,n).

%H <a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,-1)

%F a(n) = A109049(n) / A109011(n). - _R. J. Mathar_, Feb 12 2019

%F a(n) = 2*a(n-8)-a(n-16). - _R. J. Mathar_, Feb 12 2019

%F Sum_{k=1..n} a(k) ~ (293/128)*n^2. - _Amiram Eldar_, Oct 07 2023

%t LinearRecurrence[{0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,-1}, {8,4,24,2,40,12,56,1,72,20,88,6,104,28,120,2}, 37] (* _Georg Fischer_, Feb 27 2019 *)

%Y Cf. A070291, A070292, A070293, A109011, A109049.

%K easy,nonn

%O 1,1

%A _Amarnath Murthy_, May 10 2002