login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A343519 a(n) = Sum_{1 <= x_1 <= x_2 <= x_3 <= x_4 <= x_5 <= n} gcd(x_1, x_2, x_3 , x_4, x_5, n). 2

%I #17 May 23 2021 08:43:57

%S 1,7,23,64,130,287,468,864,1335,2156,3013,4790,6200,9072,11972,16440,

%T 20365,28209,33667,45014,54192,68853,80752,104964,119279,148778,

%U 172629,211252,237364,295288,324662,394368,442133,522403,578385,696624,749434,884443,975250,1136476

%N a(n) = Sum_{1 <= x_1 <= x_2 <= x_3 <= x_4 <= x_5 <= n} gcd(x_1, x_2, x_3 , x_4, x_5, n).

%H Vaclav Kotesovec, <a href="/A343519/b343519.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = Sum_{d|n} phi(n/d) * binomial(d+4, 5).

%F G.f.: Sum_{k >= 1} phi(k) * x^k/(1 - x^k)^6.

%F Sum_{k=1..n} a(k) ~ 21*zeta(5)*n^6 / (16*Pi^6). - _Vaclav Kotesovec_, May 23 2021

%t a[n_] := DivisorSum[n, EulerPhi[n/#] * Binomial[# + 4, 5] &]; Array[a, 50] (* _Amiram Eldar_, Apr 18 2021 *)

%o (PARI) a(n) = sum(a=1, n, sum(b=1, a, sum(c=1, b, sum(d=1, c, sum(e=1, d, gcd(gcd(gcd(gcd(gcd(n, a), b), c), d), e))))));

%o (PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*binomial(d+4, 5));

%o (PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k)*x^k/(1-x^k)^6))

%Y Column 5 of A343516.

%Y Cf. A000010, A343499.

%K nonn

%O 1,2

%A _Seiichi Manyama_, Apr 17 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 13 20:16 EDT 2024. Contains 375910 sequences. (Running on oeis4.)