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-10 of 11 results. Next

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

A366622 Sum of the divisors of 6^n-1.

Original entry on oeis.org

6, 48, 264, 1824, 9672, 67584, 335928, 2367552, 13031040, 94708224, 454285152, 3523559424, 15677418768, 113738502240, 599516366592, 4210539708672, 20465720064000, 154928015278080, 735060126170880, 5906693566844928, 26937015875831424, 188358079273592832
Offset: 1

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(4)=1824 because 6^4-1 has divisors {1, 5, 7, 35, 37, 185, 259, 1295}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](6^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1, 6^Range[30]-1]

Formula

a(n) = sigma(6^n-1) = A000203(A024062(n)).

A366662 Sum of the divisors of 9^n-1.

Original entry on oeis.org

15, 186, 1680, 15876, 123690, 1541568, 8992680, 111757968, 967814400, 9366647892, 62424587520, 852903426816, 4766016364260, 55176998178240, 550081165885440, 4829754617483040, 31725040326819840, 471309320999516160, 2535353780263288800, 33995669076586206864
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

			a(2)=186 because 9^2-1 has divisors {1, 2, 4, 5, 8, 10, 16, 20, 40, 80}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](9^n-1):
    seq(a(n), n=1..30);
  • Mathematica
    DivisorSigma[1, 9^Range[30]-1]

Formula

a(n) = sigma(9^n-1) = A000203(A024101(n)).
a(n) = A366576(2*n) = A366576(n) * A366578(n) * (2^(4 + A007814(n)) - 1) / (2^(3 + A007814(n)) - 1) / 3. - Max Alekseyev, Jan 07 2024

A366603 Sum of the divisors of 4^n-1.

Original entry on oeis.org

4, 24, 104, 432, 1536, 8736, 22528, 111456, 473600, 1999872, 5909760, 38054016, 89522176, 462274560, 2015330304, 7304603328, 22907191296, 166290432000, 366506672128, 2220409884672, 7645340651520, 29833839544320, 95821839806976, 648494317126656
Offset: 1

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(4)=432 because 4^4-1 has divisors {1, 3, 5, 15, 17, 51, 85, 255}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](4^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1,4^Range[30]-1] (* Paolo Xausa, Oct 14 2023 *)

Formula

a(n) = sigma(4^n-1) = A000203(A024036(n)).
a(n) = A069061(n) * A075708(n). - Robert Israel, Nov 22 2023

A366613 Sum of the divisors of 5^n-1.

Original entry on oeis.org

7, 60, 224, 1736, 6048, 49920, 136724, 1107792, 3718400, 27060480, 85449224, 869499904, 2136230474, 15820920000, 61359427584, 461863805760, 1338408456700, 13177159680000, 33558717136896, 301282248701952, 863701914880000, 6313641012910080, 20863951122979048
Offset: 1

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(3)=224 because 5^3-1 has divisors {1, 2, 4, 31, 62, 124}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](5^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1, 5^Range[30]-1]

Formula

a(n) = sigma(5^n-1) = A000203(A024049(n)).

A366634 Sum of the divisors of 7^n-1.

Original entry on oeis.org

12, 124, 780, 7812, 33624, 354640, 1704240, 18929096, 97036800, 800520192, 3958188480, 56928231360, 193778020824, 1830926384640, 11181115146240, 115997032277280, 465294239722800, 5175558387507200, 22852200371636160, 287850454432579584, 1318081737957660000
Offset: 1

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(5)=33624 because 7^5-1 has divisors {1, 2, 3, 6, 2801, 5602, 8403, 16806}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](7^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1, 7^Range[30]-1]

Formula

a(n) = sigma(7^n-1) = A000203(A024075(n)).

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

A366576 Sum of the divisors of 3^n-1.

Original entry on oeis.org

3, 15, 42, 186, 399, 1680, 3282, 15876, 31836, 123690, 277344, 1541568, 2391486, 8992680, 25483332, 111757968, 193819392, 967814400, 1744488660, 9366647892, 16912999320, 62424587520, 144219337920, 852903426816, 1397135488896, 4766016364260, 12477973754400
Offset: 1

Views

Author

Sean A. Irvine, Oct 13 2023

Keywords

Examples

			a(4)=186 because 3^4-1 has divisors {1, 2, 4, 5, 8, 10, 16, 20, 40, 80}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](3^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1,3^Range[30]-1] (* Paolo Xausa, Oct 15 2023 *)

Formula

a(n) = sigma(3^n-1) = A000203(A024023).

A366656 Number of divisors of 8^n+1.

Original entry on oeis.org

2, 3, 4, 8, 4, 12, 16, 12, 8, 20, 48, 24, 16, 12, 64, 64, 8, 48, 64, 24, 16, 64, 64, 24, 32, 96, 768, 192, 32, 24, 1536, 24, 8, 256, 512, 1536, 64, 96, 256, 64, 64, 96, 1024, 48, 128, 1280, 256, 96, 128, 96, 8192, 1024, 32, 48, 1024, 2304, 256, 192, 256, 192
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

			a(4)=4 because 8^4+1 has divisors {1, 17, 241, 4097}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[tau](8^n+1):
    seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[0, 8^Range[0,59] + 1] (* Paul F. Marrero Romero, Nov 12 2023 *)
  • PARI
    a(n) = numdiv(8^n+1);

Formula

a(n) = sigma0(8^n+1) = A000005(A062395(n)).
a(n) = A046798(3*n). - Max Alekseyev, Jan 09 2024
Showing 1-10 of 11 results. Next