A001616 -id:A001616 - cp's OEIS frontend

A240086 a(n) = Sum_{prime p|n} phi(gcd(p, n/p)) where phi is Euler's totient function.

0, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 1, 3, 1, 2, 2, 2, 1, 2, 4, 2, 2, 2, 1, 3, 1, 1, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 2, 6, 5, 2, 2, 1, 3, 2, 2, 2, 2, 1, 3, 1, 2, 3, 1, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 5, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 4, 2, 2, 2, 2, 2, 2, 1, 7, 3, 5, 1, 3, 1, 2, 3

Offset: 1

Peter Luschny, Mar 31 2014

Antti Karttunen, Table of n, a(n) for n = 1..10000

Cf. A000010, A001616, A010051, A001248, A006093.

with(numtheory): a := n -> add(phi(igcd(d, n/d)), d = factorset(n)); seq(a(n), n=1..100);

a[n_] := Sum[EulerPhi[GCD[p, n/p]], {p, FactorInteger[n][[;;, 1]]}]; a[1] = 0; Array[a, 100] (* Amiram Eldar, Aug 29 2023 *)

A240086(n) = sumdiv(n,p,(isprime(p)*eulerphi(gcd(p, n/p)))); \\ Antti Karttunen, Sep 23 2017

If n = p^2 for some prime p then a(n) = p - 1 and a(k) <= a(n) for k <= n. - Peter Luschny, Sep 05 2023

More terms from Antti Karttunen, Sep 23 2017

A273510 a(n) is the largest level N such that genus of modular curve X_0(N) is n (or -1 if no such curve exists).

Original entry on oeis.org

25, 49, 50, 64, 81, 75, 121, 100, 169, 128, 127, 147, 157, 163, 181, 193, 199, 289, 229, 243, 239, 257, 361, 283, 293, 313, 343, 337, 349, 353, 373, 379, 397, 409, 421, 529, 439, 457, 463, 467, 487, 499, 509, 523, 541, 547, 557, 577, 625, 601, 613, 619, 631, 643, 661, 673, 677, 691, 841, 667, 733

Offset: 0

Gheorghe Coserea, May 23 2016

sign

a(10^7) = 120000007 is the largest value in the first 1+10^7 terms of the sequence.

The exception occurs first at a(150) = -1. - Georg Fischer, Feb 15 2019

			For n = 0 we have 0 = A001617(k) when k is 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 16, 18, 25 (A091401); the largest of this values is 25 therefore a(0) = 25.
For n = 1 we have 1 = A001617(k) when k is 11, 14, 15, 17, 19, 20, 21, 24, 27, 32, 36, 49 (A091403); the largest of this values is 49 therefore a(1) = 49.
For n = 2 we have 2 = A001617(k) when k is 22, 23, 26, 28, 29, 31, 37, 50 (A091404); the largest of this values is 50 therefore a(2) = 50.
For n = 150 (= A054729(1)) we have 150 <> A001617(k) for all k therefore a(150) = -1.

Gheorghe Coserea, Table of n, a(n) for n = 0..200010
J. A. Csirik, M. Zieve, and J. Wetherell, On the genera of X0(N), arXiv:math/0006096 [math.NT], 2000.

Cf. A001617, A054728, A054729, A091401, A091403, A091404, A273445.

a1617[n_] := If[n < 1, 0, 1 + Sum[MoebiusMu[d]^2 n/d/12 - EulerPhi[GCD[d, n/d]]/2, {d, Divisors[n]}] - Count[(#^2 - # + 1)/n& /@ Range[n], ?IntegerQ]/3 - Count[(#^2 + 1)/n& /@ Range[n], ?IntegerQ]/4];
seq[n_] := Module[{a, bnd}, a = Table[-1, {n+1}]; bnd = 12n + 18 Floor[Sqrt[n] ] + 100; For[k = 1, k <= bnd, k++, g = a1617[k]; If[g <= n, a[[g+1]] = k]]; a];
seq[60] (* Jean-François Alcover, Nov 20 2018, after Gheorghe Coserea and Michael Somos in A001617 *)

A000089(n) = {
  if (n%4 == 0 || n%4 == 3, return(0));
  if (n%2 == 0, n \= 2);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 4 == 3, 0, 2));
};
A000086(n) = {
  if (n%9 == 0 || n%3 == 2, return(0));
  if (n%3 == 0, n \= 3);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 3 == 2, 0, 2));
};
A001615(n) = {
  my(f = factor(n), fsz = matsize(f)[1],
     g = prod(k=1, fsz, (f[k, 1]+1)),
     h = prod(k=1, fsz, f[k, 1]));
  return((n*g)\h);
};
A001616(n) = {
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, f[k, 1]^(f[k, 2]\2) + f[k, 1]^((f[k, 2]-1)\2));
};
A001617(n) = 1 + A001615(n)/12 - A000089(n)/4 - A000086(n)/3 - A001616(n)/2;
seq(n) = {
  my(a = vector(n+1, g, -1), bnd = 12*n + 18*sqrtint(n) + 100, g);
  for (k = 1, bnd, g = A001617(k); if (g <= n, a[g+1] = k));
  return(a);
};
seq(60)

Let S(n) = {k, n = A001617(k)}; if the level set S(n) is not empty then a(n) = max S(n) and A054728(n) = min S(n) and A273445(n) = card S(n), otherwise a(n) = A054728(n) = -1 and A273445(n) = 0.

A276181 Fricke's 37 cases for two-valued modular equations.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 29, 31, 32, 35, 36, 39, 41, 47, 49, 50, 59, 71

Offset: 1

Gheorghe Coserea, Oct 17 2016

Harvey Cohn, Fricke's Two-Valued Modular Equations, Math. Comp. 51 (1988), 787-807.

Cf. A000003, A001617.

A000003(n) = qfbclassno(-4*n);
A000089(n) = {
  if (n%4 == 0 || n%4 == 3, return(0));
  if (n%2 == 0, n \= 2);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 4 == 3, 0, 2));
};
A000086(n) = {
  if (n%9 == 0 || n%3 == 2, return(0));
  if (n%3 == 0, n \= 3);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 3 == 2, 0, 2));
};
A001615(n) = {
  my(f = factor(n), fsz = matsize(f)[1],
     g = prod(k=1, fsz, (f[k, 1]+1)),
     h = prod(k=1, fsz, f[k, 1]));
  return((n*g)\h);
};
A001616(n) = {
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, f[k, 1]^(f[k, 2]\2) + f[k, 1]^((f[k, 2]-1)\2));
};
A001617(n) = 1 + A001615(n)/12 - A000089(n)/4 - A000086(n)/3 - A001616(n)/2;
A276183(n) = {
  my(r = if (n%8 == 3, 4, n%8 == 7, 6, 3));
  if (n < 5, 0, (1 + A001617(n))/2 -  r * A000003(n)/12);
};
select(x->(x>1), Vec(select(x->x==0, vector(100, n, A276183(n)), 1)))

Numbers n>1 such that 0 = A276183(n).

A276184 Numbers n such that A276183(n) = 1.

Original entry on oeis.org

22, 28, 30, 33, 34, 37, 38, 40, 43, 44, 45, 48, 51, 53, 54, 55, 56, 61, 63, 64, 65, 75, 79, 81, 83, 89, 95, 101, 119, 131

Offset: 1

Gheorghe Coserea, Oct 22 2016

Harvey Cohn, Fricke's Two-Valued Modular Equations, Math. Comp. 51 (1988), 787-807.

Cf. A276183.

A000003(n) = qfbclassno(-4*n);
A000089(n) = {
  if (n%4 == 0 || n%4 == 3, return(0));
  if (n%2 == 0, n \= 2);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 4 == 3, 0, 2));
};
A000086(n) = {
  if (n%9 == 0 || n%3 == 2, return(0));
  if (n%3 == 0, n \= 3);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 3 == 2, 0, 2));
};
A001615(n) = {
  my(f = factor(n), fsz = matsize(f)[1],
     g = prod(k=1, fsz, (f[k, 1]+1)),
     h = prod(k=1, fsz, f[k, 1]));
  return((n*g)\h);
};
A001616(n) = {
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, f[k, 1]^(f[k, 2]\2) + f[k, 1]^((f[k, 2]-1)\2));
};
A001617(n) = 1 + A001615(n)/12 - A000089(n)/4 - A000086(n)/3 - A001616(n)/2;
A276183(n) = {
  my(r = if (n%8 == 3, 4, n%8 == 7, 6, 3));
  if (n < 5, 0, (1 + A001617(n))/2 -  r * A000003(n)/12);
};
Vec(select(x->x==1, vector(5000, n, A276183(n)), 1))

A276185 Numbers n such that A276183(n) = 2.

Original entry on oeis.org

42, 46, 52, 57, 62, 67, 68, 69, 72, 73, 74, 77, 80, 87, 91, 98, 103, 107, 111, 121, 125, 143, 167, 191

Offset: 1

Gheorghe Coserea, Oct 22 2016

Harvey Cohn, Fricke's Two-Valued Modular Equations, Math. Comp. 51 (1988), 787-807.

Cf. A276183.

A000003(n) = qfbclassno(-4*n);
A000089(n) = {
  if (n%4 == 0 || n%4 == 3, return(0));
  if (n%2 == 0, n \= 2);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 4 == 3, 0, 2));
};
A000086(n) = {
  if (n%9 == 0 || n%3 == 2, return(0));
  if (n%3 == 0, n \= 3);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 3 == 2, 0, 2));
};
A001615(n) = {
  my(f = factor(n), fsz = matsize(f)[1],
     g = prod(k=1, fsz, (f[k, 1]+1)),
     h = prod(k=1, fsz, f[k, 1]));
  return((n*g)\h);
};
A001616(n) = {
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, f[k, 1]^(f[k, 2]\2) + f[k, 1]^((f[k, 2]-1)\2));
};
A001617(n) = 1 + A001615(n)/12 - A000089(n)/4 - A000086(n)/3 - A001616(n)/2;
A276183(n) = {
  my(r = if (n%8 == 3, 4, n%8 == 7, 6, 3));
  if (n < 5, 0, (1 + A001617(n))/2 -  r * A000003(n)/12);
};
Vec(select(x->x==2, vector(500, n, A276183(n)), 1))

A276186 Numbers n such that A276183(n) = 3.

Original entry on oeis.org

58, 60, 66, 76, 85, 86, 96, 97, 99, 100, 104, 109, 113, 127, 128, 139, 149, 151, 169, 179, 239

Offset: 1

Gheorghe Coserea, Oct 22 2016

Harvey Cohn, Fricke's Two-Valued Modular Equations, Math. Comp. 51 (1988), 787-807.

Cf. A276183.

A000003(n) = qfbclassno(-4*n);
A000089(n) = {
  if (n%4 == 0 || n%4 == 3, return(0));
  if (n%2 == 0, n \= 2);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 4 == 3, 0, 2));
};
A000086(n) = {
  if (n%9 == 0 || n%3 == 2, return(0));
  if (n%3 == 0, n \= 3);
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, if (f[k, 1] % 3 == 2, 0, 2));
};
A001615(n) = {
  my(f = factor(n), fsz = matsize(f)[1],
     g = prod(k=1, fsz, (f[k, 1]+1)),
     h = prod(k=1, fsz, f[k, 1]));
  return((n*g)\h);
};
A001616(n) = {
  my(f = factor(n), fsz = matsize(f)[1]);
  prod(k = 1, fsz, f[k, 1]^(f[k, 2]\2) + f[k, 1]^((f[k, 2]-1)\2));
};
A001617(n) = 1 + A001615(n)/12 - A000089(n)/4 - A000086(n)/3 - A001616(n)/2;
A276183(n) = {
  my(r = if (n%8 == 3, 4, n%8 == 7, 6, 3));
  if (n < 5, 0, (1 + A001617(n))/2 -  r * A000003(n)/12);
};
Vec(select(x->x==3, vector(500, n, A276183(n)), 1))

cp's OEIS Frontend

A240086 a(n) = Sum_{prime p|n} phi(gcd(p, n/p)) where phi is Euler's totient function.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A273510 a(n) is the largest level N such that genus of modular curve X_0(N) is n (or -1 if no such curve exists).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A276181 Fricke's 37 cases for two-valued modular equations.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A276184 Numbers n such that A276183(n) = 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A276185 Numbers n such that A276183(n) = 2.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A276186 Numbers n such that A276183(n) = 3.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI