cp's OEIS Frontend

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.

Showing 1-4 of 4 results.

A341015 Numbers k such that A124446(k) = 1.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 9, 18, 25, 27, 54, 81, 125, 162, 243, 486, 625, 729, 1458, 2187, 3125, 4374, 6561, 13122, 15625, 19683, 39366, 59049, 78125, 118098, 177147, 354294, 390625, 531441, 1062882, 1594323, 1953125, 3188646, 4782969, 9565938, 9765625, 14348907, 28697814
Offset: 1

Views

Author

J. M. Bergot and Robert Israel, Feb 02 2021

Keywords

Comments

Numbers k such that A066840(k) and A124440(k) are coprime.
Contains all numbers of the forms 3^j, 2*3^j and 5^j.
Conjecture: the only term not of one of those forms is 4.

Examples

			18 is a term because A066840(18) = 13 and A124440(18) = 41 are coprime.

Crossrefs

Cf. A066840, A124440, A124446.

Programs

  • Maple
    N:= 2*10^4: # for terms <= N
G:= add(numtheory:-mobius(n)*n*x^(2*n)/((1-x^n)*(1-x^(2*n))^2),n=1..N/2):
S:= series(G,x,N+1):
A66840:= [seq(coeff(S,x,j),j=1..N)]:
filter:= n -> igcd(A66840[n], n*numtheory:-phi(n)/2)=1:
filter(1):= true:
select(filter, [$1..N]);

Formula

A124446(a(n)) = 1.

Extensions

More terms from Jinyuan Wang, Feb 07 2021

A066840 Sum of positive integers k where k <= n/2 and gcd(k,n) = 1.

Original entry on oeis.org

0, 1, 1, 1, 3, 1, 6, 4, 7, 4, 15, 6, 21, 9, 14, 16, 36, 13, 45, 20, 30, 25, 66, 24, 63, 36, 61, 42, 105, 32, 120, 64, 80, 64, 102, 54, 171, 81, 114, 80, 210, 66, 231, 110, 134, 121, 276, 96, 258, 124, 200, 156, 351, 121, 270, 168, 252, 196, 435, 120, 465, 225, 282
Offset: 1

Views

Author

Leroy Quet, Jan 20 2002

Keywords

Comments

a(n) = n iff n = 16, 20, 24. - Bernard Schott, Mar 17 2021

Examples

			a(8) = 4 = 1 + 3 because 1 and 3 are the positive integers <= 8 / 2 = 4 and relatively prime to 8.
a(36) = 54. First, factor 36 = 2^2 * 3^2. look at distinct prime factors, 2 and 3. Add all positive integers up to floor(36/2) = 18, gives binomial(18 + 1, 2) = 171. Subtract all multiples of 2, i.e., subtract 2 * binomial(1+floor(18/2), 2) = 90, gives 171 - 90 = 81. Subtract all multiples of 3, i.e., subtract 3 * binomial(1+floor(18/3), 2) = 63, gives 81 - 63 = 18. Multiples of 2 * 3 = 6 were subtracted twice so add them, i.e., add 6 * binomial(1+floor(18/6), 2) = 36. Gives 18 + 36 = 54.
a(29#) = 826398242058977280 where p# is as in A002110. - _David A. Corneth_, Apr 14 2015

Links

Crossrefs

Cf. A124440, A124446, A124447, A282600, A282601.

Programs

  • Maple
    seq(convert(select(k->igcd(k,n)=1, [$1..floor(n/2)]),`+`),n=1..100); # Robert Israel, Apr 12 2015
  • Mathematica
    f[n_] := Plus @@ Select[Range[Floor[n/2]], GCD[ #, n] == 1 &];Table[f[n], {n, 65}] (* Ray Chandler, Dec 06 2006 *)
  • PARI
    for (n=1, 1000, k=1; s=0; while(k<=n/2, if (gcd(k, n) == 1, s+=k); k++); write("b066840.txt", n, " ", s) ) \\ Harry J. Smith, Apr 01 2010
  • PARI
    a(n) = sum(k=1, n\2, if (gcd(n,k)==1, k)); \\ Michel Marcus, Nov 12 2014
  • PARI
    a(n) = {my(h=n\2, d, b, r=0); f=factor(n)[,1]; for(i=0,2^#f - 1, b=binary(i); d=#f-#b; p=prod(j=1,#b,f[j+#f-#b]^b[j]); r += (-1)^vecsum(b) * p * binomial(1+h\p,2));r} \\ David A. Corneth, Apr 14 2015

Formula

For odd prime p, a(p) = (p^2-1)/8. - Thomas Ordowski, Nov 12 2014
Conjecture: a(n) = n*phi(n)/8 + O(n). - Thomas Ordowski, Nov 12 2014
G.f.: Sum_{n>=1} mu(n)*n*x^(2*n)/((1-x^n)*(1-x^(2*n))^2), where mu(n)=A008683(n). - Mamuka Jibladze, Apr 05 2015
For prime p: a(2p) = floor(p/2)^2. a(3p) = (p-1)(3p-1)/4, p>3. a(4p) = (p-1)*p, p>2. a(5p) = (p-1)(5p-1)/2, p=3 or p>5, ... - M. F. Hasler, Apr 09 2015
For odd prime p and e>0, a(p^e) = (p^(2e-1)+1)*(p-1)/8; a(2^e) = 4^(e-2) for e>1 (and a(2)=1). - Mamuka Jibladze, Apr 10 2015
If n == 0 (mod 4) then a(n) = n*phi(n)/8. - Robert Israel, Apr 13 2015
If n is prime then a(n) = binomial(1 + floor(n/2), 2). - David A. Corneth, Apr 14 2015
a(n) = (1/2) * Sum_{k=1..n} k * [gcd(k,2*n-k) = 2], where [ ] is the Iverson bracket. - Wesley Ivan Hurt, Jun 07 2021

A124440 a(n) = Sum_{n/2<=k<=n, gcd(k,n)=1} k.

Original entry on oeis.org

1, 1, 2, 3, 7, 5, 15, 12, 20, 16, 40, 18, 57, 33, 46, 48, 100, 41, 126, 60, 96, 85, 187, 72, 187, 120, 182, 126, 301, 88, 345, 192, 250, 208, 318, 162, 495, 261, 354, 240, 610, 186, 672, 330, 406, 385, 805, 288, 771, 376, 616, 468, 1027, 365, 830, 504, 774, 616, 1276
Offset: 1

Views

Author

Leroy Quet, Nov 01 2006

Keywords

Examples

			The integers which are >= 10/2 and are <= 10 and which are coprime to 10 are 7 and 9. So a(10) = 7 + 9 = 16.

Links

Crossrefs

Cf. A066840, A124446, A124447.

Programs

  • Maple
    N:= 100: # for a(1)..a(N)
G:= add(numtheory:-mobius(n)*n*x^(2*n)/((1-x^n)*(1-x^(2*n))^2), n=1..N/2):
S:= series(G, x, N+1):
A66840:= [seq(coeff(S, x, j), j=1..N)]:
f:= proc(n) n*numtheory:-phi(n)/2 - A66840[n] end proc:
f(1):= 1: f(2):= 1:
map(f, [$1..N]); # Robert Israel, Feb 02 2021
  • Mathematica
    a[n_] := Plus @@ Select[Range[Ceiling[n/2], n], GCD[ #, n] == 1 &];Table[a[n], {n, 60}] (* Ray Chandler, Nov 12 2006 *)
  • PARI
    a(n) = sum(k=ceil(n/2), n, if (gcd(n, k)==1, k)); \\ Michel Marcus, Feb 03 2021

Formula

For n > 2, a(n) = phi(n)*n/2 - A066840(n).

Extensions

Extended by Ray Chandler, Nov 12 2006

A124447 a(n) = lcm(A066840(n), A124440(n)).

Original entry on oeis.org

0, 1, 2, 3, 21, 5, 30, 12, 140, 16, 120, 18, 399, 99, 322, 48, 900, 533, 630, 60, 480, 425, 1122, 72, 11781, 360, 11102, 126, 4515, 352, 2760, 192, 2000, 832, 5406, 162, 9405, 2349, 6726, 240, 12810, 2046, 7392, 330, 27202, 4235, 9660, 288, 66306, 11656
Offset: 1

Views

Author

Leroy Quet, Nov 01 2006

Keywords

Examples

			Those positive integers which are coprime to 8 and are <= 8/2, are 1 and 3. Those integers which are coprime to 8 and are between 8/2 and 8, are 5 and 7.
So a(8) = lcm(1+3,5+7) = lcm(4,12) = 12.

Crossrefs

Cf. A066840, A124440, A124446.

Programs

  • Mathematica
    f1[n_] := Plus @@ Select[Range[Floor[n/2]], GCD[ #,n] == 1 &]; f2[n_] := Plus @@ Select[Range[Ceiling[n/2], n], GCD[ #, n] == 1 &];Table[LCM[f1[n], f2[n]], {n, 51}] (* Ray Chandler, Nov 12 2006 *)

Extensions

Extended by Ray Chandler, Nov 12 2006
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.