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.

A370050 Square array read by ascending antidiagonals: T(n,k) is the size of the group Z_p*/(Z_p*)^k, where p = prime(n), and Z_p is the ring of p-adic integers.

Original entry on oeis.org

1, 1, 4, 1, 2, 1, 1, 2, 3, 8, 1, 2, 1, 2, 1, 1, 2, 3, 4, 1, 4, 1, 2, 1, 2, 5, 6, 1, 1, 2, 3, 2, 1, 2, 1, 16, 1, 2, 1, 4, 5, 6, 1, 2, 1, 1, 2, 3, 4, 1, 2, 7, 4, 9, 4, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 3, 10, 1, 8, 1, 2, 3, 4, 1, 6, 1, 4, 1, 2, 1, 6, 1
Offset: 1

Views

Author

Jianing Song, Apr 30 2024

Keywords

Comments

We have that Z_p*/(Z_p*)^k is the inverse limit of (Z/p^iZ)*/((Z/p^iZ)*)^k as i tends to infinity. Write k = p^e * k' with k' not being divisible by p. If p is odd, then the group is cyclic of order p^e * gcd(p-1,k'). If p = 2 and k is odd, then the group is trivial. If p = 2 and k is even, then the group is the product of a cyclic group of order 2^e and a cyclic group of order 2.
Each row is multiplicative.

Examples

			Table reads
  1, 4, 1, 8, 1, 4, 1, 16, 1, 4
  1, 2, 3, 2, 1, 6, 1, 2, 9, 2
  1, 2, 1, 4, 5, 2, 1, 4, 1, 10
  1, 2, 3, 2, 1, 6, 7, 2, 3, 2
  1, 2, 1, 2, 5, 2, 1, 2, 1, 10
  1, 2, 3, 4, 1, 6, 1, 4, 3, 2
  1, 2, 1, 4, 1, 2, 1, 8, 1, 2
  1, 2, 3, 2, 1, 6, 1, 2, 9, 2
  1, 2, 1, 2, 1, 2, 1, 2, 1, 2
  1, 2, 1, 4, 1, 2, 7, 4, 1, 2
For p = prime(1) = 2 and k = 2, we have Z_p*/(Z_p*)^k = Z_2*/(1+8Z_2) = (Z/8Z)*/(1+8Z) = C_2 X C_2, so T(1,2) = 4.
For p = prime(2) = 3 and k = 3, we have Z_p*/(Z_p*)^k = Z_3*/((1+9Z_3) U (8+9Z_3)) = (Z/9Z)*/((1+9Z) U (8+9Z)) = C_3, so T(2,3) = 3.
		

Crossrefs

Programs

  • PARI
    T(n,k) = my(p = prime(n), e = valuation(k,p)); p^e*gcd(p-1,k/p^e) * if(p==2 && e>=1, 2, 1)

Formula

Write k = p^e * k' with k' not being divisible by p, and p = prime(n). If p is odd, then T(n,k) = p^e * gcd(p-1,k'). If p = 2 and k is odd, then T(n,k) = 1. If p = 2 and k is even, then T(n,k) = 2^(e+1).

A370566 Size of the group Q_5*/(Q_5*)^n, where Q_5 is the field of 5-adic numbers.

Original entry on oeis.org

1, 4, 3, 16, 25, 12, 7, 32, 9, 100, 11, 48, 13, 28, 75, 64, 17, 36, 19, 400, 21, 44, 23, 96, 625, 52, 27, 112, 29, 300, 31, 128, 33, 68, 175, 144, 37, 76, 39, 800, 41, 84, 43, 176, 225, 92, 47, 192, 49, 2500, 51, 208, 53, 108, 275, 224, 57, 116, 59, 1200, 61, 124, 63, 256
Offset: 1

Views

Author

Jianing Song, Apr 30 2024

Keywords

Comments

We have Q_5* = 5^Z X Z_5*, so Q_5*/(Q_5*)^k = (5^Z/5^(kZ)) X (Z_p*/(Z_5*)^k). Note that 5^Z/5^(kZ) is a cyclic group of order k. For the group structure of (Z_5*/(Z_5*)^k), see A370050.

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{e2 = IntegerExponent[n, 2], e5 = IntegerExponent[n, 5]}, 2^Min[e2, 2] * 5^e5 * n]; Array[a, 100] (* Amiram Eldar, May 20 2024 *)
  • PARI
    a(n, {p=5}) = my(e = valuation(n, p)); n * p^e*gcd(p-1, n/p^e)

Formula

Write n = 5^e * n' with k' not being divisible by 5, then a(n) = n * 5^e * gcd(4,n').
Multiplicative with a(5^e) = 5^(2*e), a(2) = 4, a(2^e) = 2^(e+2) for e >= 2 and a(p^e) = p^e for primes p != 2, 5.
a(n) = n * A370181(n).
From Amiram Eldar, May 20 2024: (Start)
Dirichlet g.f.: ((1 + 1/2^(s-1) + 1/2^(2*s-3)) * (1 - 1/5^(s-1))/(1 - 1/5^(s-2))) * zeta(s-1).
Sum_{k=1..n} a(k) ~ (4*n^2/(5*log(5))) * (log(n) + gamma - 1/2 + 3*log(5/2)/4), where gamma is Euler's constant (A001620). (End)

A370180 Size of the group Z_3*/(Z_3*)^n, where Z_3 is the ring of 3-adic integers.

Original entry on oeis.org

1, 2, 3, 2, 1, 6, 1, 2, 9, 2, 1, 6, 1, 2, 3, 2, 1, 18, 1, 2, 3, 2, 1, 6, 1, 2, 27, 2, 1, 6, 1, 2, 3, 2, 1, 18, 1, 2, 3, 2, 1, 6, 1, 2, 9, 2, 1, 6, 1, 2, 3, 2, 1, 54, 1, 2, 3, 2, 1, 6, 1, 2, 9, 2, 1, 6, 1, 2, 3, 2, 1, 18, 1, 2, 3, 2, 1, 6, 1, 2, 81, 2, 1, 6, 1, 2, 3, 2, 1, 18
Offset: 1

Views

Author

Jianing Song, Apr 30 2024

Keywords

Comments

We have that Z_3*/(Z_3*)^n is the inverse limit of (Z/3^iZ)*/((Z/3^iZ)*)^n as i tends to infinity. Write n = 3^e * n' with n' not being divisible by 3, then the group is cyclic of order 3^e * gcd(2,n'). See A370050.

Examples

			We have Z_3*/(Z_3*)^3 = Z_3* / ((1+9Z_3) U (8+9Z_3)) = (Z/9Z)*/((1+9Z) U (8+9Z)) = C_3, so a(3) = 3.
We have Z_3*/(Z_3*)^6 = Z_3* / (1+9Z_3) = (Z/9Z)*/(1+9Z) = C_6, so a(6) = 6.
		

Crossrefs

Cf. A370565.

Programs

  • Mathematica
    a[n_] := Module[{e2 = IntegerExponent[n, 2], e3 = IntegerExponent[n, 3]}, 2^If[e2 == 0, 0, 1] * 3^e3]; Array[a, 100] (* Amiram Eldar, May 20 2024 *)
  • PARI
    a(n,{p=3}) = my(e = valuation(n, p)); p^e*gcd(p-1, n/p^e)

Formula

Multiplicative with a(3^e) = 3^e, a(2^e) = 2 and a(p^e) = 1 for primes p != 2, 3.
From Amiram Eldar, May 20 2024: (Start)
Dirichlet g.f.: (1 + 1/2^s) * ((1 - 1/3^s)/(1 - 1/3^(s-1))) * zeta(s).
Sum_{k=1..n} a(k) ~ (n/log(3)) * (log(n) + gamma - 1 + log(3) - log(2)/3), where gamma is Euler's constant (A001620). (End)

A370182 Size of the group Z_7*/(Z_7*)^n, where Z_7 is the ring of 7-adic integers.

Original entry on oeis.org

1, 2, 3, 2, 1, 6, 7, 2, 3, 2, 1, 6, 1, 14, 3, 2, 1, 6, 1, 2, 21, 2, 1, 6, 1, 2, 3, 14, 1, 6, 1, 2, 3, 2, 7, 6, 1, 2, 3, 2, 1, 42, 1, 2, 3, 2, 1, 6, 49, 2, 3, 2, 1, 6, 1, 14, 3, 2, 1, 6, 1, 2, 21, 2, 1, 6, 1, 2, 3, 14, 1, 6, 1, 2, 3, 2, 7, 6, 1, 2, 3, 2, 1, 42, 1, 2, 3, 2, 1, 6
Offset: 1

Views

Author

Jianing Song, Apr 30 2024

Keywords

Comments

We have that Z_7*/(Z_7*)^n is the inverse limit of (Z/7^iZ)*/((Z/7^iZ)*)^n as i tends to infinity. Write n = 7^e * n' with n' not being divisible by 7, then the group is cyclic of order 7^e * gcd(7,n'). See A370050.

Examples

			We have Z_7*/(Z_7*)^7 = Z_7* / ((1+49Z_7) U (18+49Z_7) U (19+49Z_7) U (30+49Z_7) U (31+49Z_7) U (48+49Z_7)) = (Z/49Z)*/((1+49Z) U (18+49Z) U (19+49Z) U (30+49Z) U (31+49Z) U (48+49Z)) = C_7, so a(7) = 7.
We have Z_7*/(Z_7*)^14 = Z_7* / ((1+49Z_7) U (18+49Z_7) U (30+49Z_7)) = (Z/49Z)*/((1+49Z) U (18+49Z) U (30+49Z)) = C_14, so a(14) = 14.
		

Crossrefs

Cf. A370567.

Programs

  • Mathematica
    a[n_] := Module[{e2 = IntegerExponent[n, 2], e3 = IntegerExponent[n, 3], e7 = IntegerExponent[n, 7]}, 2^Min[e2, 1] * 3^Min[e3, 1] * 7^e7]; Array[a, 100] (* Amiram Eldar, May 20 2024 *)
  • PARI
    a(n,{p=7}) = my(e = valuation(n, p)); p^e*gcd(p-1, n/p^e)

Formula

Multiplicative with a(7^e) = 7^e, a(2^e) = 2, a(3^e) = 3 and a(p^e) = 1 for primes p != 2, 3, 7.
From Amiram Eldar, May 20 2024: (Start)
Dirichlet g.f.: (1 + 1/2^s) * (1 + 2/3^s) * ((1 - 1/7^s)/(1 - 1/7^(s-1))) * zeta(s).
Sum_{k=1..n} a(k) ~ (15*n/(7*log(7))) * (log(n) + gamma - 1 + 2*log(7)/3 - 2*log(3)/5 - log(2)/3), where gamma is Euler's constant (A001620). (End)
Showing 1-4 of 4 results.