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.

Previous Showing 11-17 of 17 results.

A366654 a(n) = phi(8^n-1), where phi is Euler's totient function (A000010).

Original entry on oeis.org

6, 36, 432, 1728, 27000, 139968, 1778112, 6635520, 113467392, 534600000, 6963536448, 26121388032, 465193834560, 2427720325632, 28548223200000, 109586090557440, 1910296842179040, 9618417501143040, 123523151337020736, 406467072000000000, 7713001620195508224
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Crossrefs

phi(k^n-1): A053287 (k=2), A295500 (k=3), A295501 (k=4), A295502 (k=5), A366623 (k=6), A366635 (k=7), this sequence (k=8), A366663 (k=9), A295503 (k=10), A366685 (k=11), A366711 (k=12).

Programs

  • Mathematica
    EulerPhi[8^Range[30] - 1]
  • PARI
    {a(n) = eulerphi(8^n-1)}
    
  • Python
    from sympy import totient
    def A366654(n): return totient((1<<3*n)-1) # Chai Wah Wu, Oct 15 2023

Formula

a(n) = A053287(3*n). - Max Alekseyev, Jan 09 2024

A366653 Sum of the divisors of 8^n-1.

Original entry on oeis.org

8, 104, 592, 8736, 38912, 473600, 2466048, 38054016, 155493536, 2015330304, 10359014400, 166290432000, 636328345600, 7645340651520, 42424026529792, 648494317126656, 2599936977797120, 32817383473149440, 164708609085669376, 3010983668199456768
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

			a(5)=38912 because 8^5-1 has divisors {1, 7, 31, 151, 217, 1057, 4681, 32767}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](8^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1, 8^Range[30]-1]
  • SageMath
    [sigma(8**n-1, 1) for n in range(1, 21)] # Stefano Spezia, Aug 02 2025

Formula

a(n) = sigma(8^n-1) = A000203(A024088(n)).
a(n) = A075708(3*n). - Max Alekseyev, Jan 09 2024

A085033 Number of prime factors of cyclotomic(n,8), which is A019326(n), the value of the n-th cyclotomic polynomial evaluated at x=8.

Original entry on oeis.org

1, 2, 1, 2, 2, 2, 3, 2, 1, 2, 3, 2, 3, 2, 2, 3, 4, 2, 3, 4, 2, 3, 3, 2, 4, 2, 3, 4, 5, 1, 2, 3, 3, 4, 5, 2, 5, 3, 4, 2, 4, 1, 4, 4, 3, 3, 5, 2, 3, 3, 2, 8, 7, 4, 4, 3, 2, 3, 5, 3, 4, 3, 2, 3, 2, 2, 5, 7, 4, 5, 6, 2, 6, 5, 4, 6, 3, 1, 7, 3, 4, 5, 4, 2
Offset: 1

Views

Author

T. D. Noe, Jun 19 2003

Keywords

Comments

The Mobius transform of this sequence yields A057953, number of prime factors of 8^n-1.

References

Crossrefs

omega(Phi(n,x)): A085021 (x=2), A085028 (x=3), A085029 (x=4), A085030 (x=5), A085031 (x=6), A085032 (x=7), this sequence (x=8), A085034 (x=9), A085035 (x=10).

Programs

  • Mathematica
    Table[Plus@@Transpose[FactorInteger[Cyclotomic[n, 8]]][[2]], {n, 1, 100}]

A366651 Number of distinct prime divisors of 8^n - 1.

Original entry on oeis.org

1, 2, 2, 4, 3, 4, 3, 6, 3, 6, 4, 8, 4, 6, 6, 9, 5, 6, 4, 11, 6, 8, 4, 12, 7, 7, 6, 12, 6, 11, 3, 12, 8, 10, 10, 12, 6, 8, 9, 15, 5, 11, 5, 14, 10, 8, 6, 17, 5, 13, 8, 16, 8, 12, 10, 17, 7, 10, 6, 21, 5, 7, 9, 15, 8, 15, 6, 19, 9, 20, 7, 18, 7, 12, 14, 16, 9
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Crossrefs

Programs

  • PARI
    for(n = 1, 100, print1(omega(8^n - 1), ", "))

Formula

a(n) = omega(8^n-1) = A001221(A024088(n)).
a(n) = A046800(3*n). - Max Alekseyev, Jan 09 2024

A366652 Number of divisors of 8^n-1.

Original entry on oeis.org

2, 6, 4, 24, 8, 32, 12, 96, 8, 96, 16, 512, 16, 144, 64, 768, 32, 160, 16, 4608, 96, 384, 16, 8192, 128, 192, 64, 9216, 64, 4096, 8, 6144, 256, 1536, 1536, 10240, 64, 384, 512, 73728, 32, 6144, 32, 24576, 1024, 384, 64, 262144, 64, 12288, 256, 147456, 256
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

			a(5)=8 because 8^5-1 has divisors {1, 7, 31, 151, 217, 1057, 4681, 32767}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[tau](8^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[0, 8^Range[100]-1]
  • PARI
    a(n) = numdiv(8^n-1);

Formula

a(n) = sigma0(8^n-1) = A000005(A024088(n)).
a(n) = A046801(3*n). - Max Alekseyev, Jan 09 2024

A366708 Number of prime factors of 12^n - 1 (counted with multiplicity).

Original entry on oeis.org

1, 2, 2, 4, 2, 5, 3, 6, 4, 4, 4, 8, 3, 6, 6, 9, 3, 9, 2, 8, 5, 6, 4, 12, 4, 8, 6, 10, 5, 13, 5, 11, 8, 6, 9, 14, 3, 6, 7, 14, 4, 14, 5, 12, 12, 8, 3, 18, 5, 10, 6, 13, 7, 16, 8, 13, 7, 8, 4, 19, 4, 8, 8, 13, 8, 17, 5, 10, 7, 14, 4, 21, 3, 7, 11, 11, 11, 18, 4
Offset: 1

Views

Author

Sean A. Irvine, Oct 17 2023

Keywords

Crossrefs

Programs

  • Mathematica
    PrimeOmega[12^Range[70]-1]
  • PARI
    a(n)=bigomega(12^n-1)

Formula

a(n) = bigomega(12^n-1) = A001222(A024140(n)).

A366682 Number of prime factors of 11^n - 1 (counted with multiplicity).

Original entry on oeis.org

2, 5, 4, 7, 4, 9, 4, 9, 5, 8, 4, 13, 4, 8, 7, 12, 3, 12, 3, 11, 10, 11, 5, 17, 8, 10, 6, 13, 4, 15, 5, 15, 9, 9, 8, 17, 6, 10, 12, 15, 9, 17, 4, 15, 9, 12, 5, 24, 7, 14, 9, 13, 6, 16, 10, 19, 8, 10, 5, 21, 5, 12, 16, 19, 8, 22, 6, 15, 10, 19, 7, 24, 3, 11, 15
Offset: 1

Views

Author

Sean A. Irvine, Oct 16 2023

Keywords

Crossrefs

Programs

  • Mathematica
    PrimeOmega[11^Range[70]-1]
  • PARI
    a(n)=bigomega(11^n-1)

Formula

a(n) = bigomega(11^n-1) = A001222(A024127(n)).
Previous Showing 11-17 of 17 results.