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!)
A015634 Number of ordered quadruples of integers from [ 1..n ] with no global factor. 6

%I #25 Jun 12 2021 09:07:30

%S 1,4,13,29,63,106,189,289,444,626,911,1203,1657,2130,2766,3462,4430,

%T 5359,6688,7992,9670,11405,13704,15840,18730,21548,25037,28521,33015,

%U 37067,42522,47690,53940,60108,67760,74748,83886,92433,102629,112469

%N Number of ordered quadruples of integers from [ 1..n ] with no global factor.

%H Chai Wah Wu, <a href="/A015634/b015634.txt">Table of n, a(n) for n = 1..10000</a>

%F G.f.: (1/(1 - x)) * Sum_{k>=1} mu(k) * x^k / (1 - x^k)^4. - _Ilya Gutkovskiy_, Feb 14 2020

%F a(n) = n*(n+1)*(n+2)*(n+3)/24 - Sum_{j=2..n} a(floor(n/j)) = A000332(n+3) - Sum_{j=2..n} a(floor(n/j)). - _Chai Wah Wu_, Apr 18 2021

%o (Python)

%o from functools import lru_cache

%o @lru_cache(maxsize=None)

%o def A015634(n):

%o if n == 0:

%o return 0

%o c, j = 1, 2

%o k1 = n//j

%o while k1 > 1:

%o j2 = n//k1 + 1

%o c += (j2-j)*A015634(k1)

%o j, k1 = j2, n//j2

%o return n*(n+1)*(n+2)*(n+3)//24-c+j-n # _Chai Wah Wu_, Apr 18 2021

%o (PARI) a(n) = sum(k=1, n, sumdiv(k, d, moebius(k/d)*binomial(d+2, 3))); \\ _Seiichi Manyama_, Jun 12 2021

%o (PARI) a(n) = binomial(n+3, 4)-sum(k=2, n, a(n\k)); \\ _Seiichi Manyama_, Jun 12 2021

%o (PARI) my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, moebius(k)*x^k/(1-x^k)^4)/(1-x)) \\ _Seiichi Manyama_, Jun 12 2021

%Y Column k=4 of A177976.

%Y Cf. A000332, A002088, A015631, A015650, A117108.

%K nonn

%O 1,2

%A _Olivier GĂ©rard_

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 August 23 18:16 EDT 2024. Contains 375396 sequences. (Running on oeis4.)