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

A057952 Number of prime factors of 9^n - 1 (counted with multiplicity).

Original entry on oeis.org

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

Views

Author

Patrick De Geest, Nov 15 2000

Keywords

Links

Crossrefs

bigomega(b^n-1): A046051 (b=2), A057958 (b=3), A057957 (b=4), A057956 (b=5), A057955 (b=6), A057954 (b=7), A057953 (b=8), this sequence (b=9), A057951 (b=10), A366682 (b=11), A366708 (b=12).
Cf. A001222, A002591, A024101, A074477, A085034, A133801, A274909, A366660, A366661, A366662.

Programs

  • Mathematica
    PrimeOmega[Table[9^n - 1, {n, 1, 30}]] (* Amiram Eldar, Feb 02 2020 *)

Formula

Mobius transform of A085034. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024101(n)) = A057958(2*n). - Amiram Eldar, Feb 02 2020
a(n) = A057941(n) + A057958(n). - Max Alekseyev, Jan 07 2024

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

Original entry on oeis.org

4, 32, 288, 2560, 26400, 165888, 2384928, 15728640, 141087744, 1246080000, 14758128000, 85996339200, 1270928131200, 8810420097024, 70207948800000, 677066362060800, 8218041445152000, 43129128265187328, 674757689572915200, 4238841176064000000
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Links

Crossrefs

phi(k^n-1): A053287 (k=2), A295500 (k=3), A295501 (k=4), A295502 (k=5), A366623 (k=6), A366635 (k=7), A366654 (k=8), this sequence (k=9), A295503 (k=10), A366685 (k=11), A366711 (k=12).
Cf. A000010, A024101, A057952, A366660, A366661, A366662, A366667.

Programs

  • Mathematica
    EulerPhi[9^Range[30] - 1]
  • PARI
    {a(n) = eulerphi(9^n-1)}

Formula

a(n) = A295500(2*n) = 2 * A295500(n) * A366579(n). - Max Alekseyev, Jan 07 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}.

Links

Crossrefs

Cf. A024062, A000203, A057955, A059888, A274907, A366620, A366621, A366623, A366629.
Cf. A075708, A366576, A366603, A366613, A366634, A366653, A366662, A102146, A366684, A366710.

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)).

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}.

Links

Crossrefs

Cf. A024088, A000203, A057953, A059890, A366651, A366652, A366654.
Cf. A075708, A366576, A366603, A366613, A366622, A366634, A366662, A102146, A366684, A366710.

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

A366661 Number of divisors of 9^n-1.

Original entry on oeis.org

4, 10, 16, 24, 24, 80, 16, 112, 128, 180, 64, 384, 16, 160, 768, 256, 128, 1280, 64, 864, 768, 640, 32, 14336, 384, 160, 4096, 1536, 256, 23040, 128, 576, 2048, 1280, 768, 12288, 128, 640, 12288, 16128, 128, 61440, 32, 12288, 196608, 320, 512, 131072, 2048
Offset: 1

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

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

Links

Crossrefs

Cf. A024101, A000005, A057952, A366660, A366662, A366663.
Cf. A046801, A366575, A366602, A366612, A366621, A366633, A366652, A070528, A366683, A366709.

Programs

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

Formula

a(n) = sigma0(9^n-1) = A000005(A024101(n)).
a(n) = A366575(2*n) = A366575(n) * A366577(n) * (4 + A007814(n)) / (2 * (3 + A007814(n))). - Max Alekseyev, Jan 07 2024

A366666 Sum of the divisors of 9^n+1.

Original entry on oeis.org

3, 18, 126, 1332, 10476, 109926, 816732, 8906760, 64570086, 706911048, 5357742012, 56496274632, 456919958880, 4661686010664, 35152280388792, 388532214509688, 2779530283277766, 30018958465575240, 230668806145962744, 2431533550553980488, 19410628990783168944
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

			a(2)=126 because 9^2+1 has divisors {1, 2, 41, 82}.

Links

Crossrefs

Cf. A062396, A000203, A057935, A366662, A366664, A366665, A366667.
Cf. A069061, A366578, A366607, A366617, A366629, A366638, A366657, A366668, A366689, A366715.

Programs

  • Maple
    a:=n->numtheory[sigma](9^n+1):
seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[1, 9^Range[0,20] + 1] (* Paul F. Marrero Romero, Nov 14 2023 *)

Formula

a(n) = sigma(9^n+1) = A000203(A062396(n)).
a(n) = A366578(2*n). - Max Alekseyev, Jan 08 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}.

Links

Crossrefs

Cf. A024036, A000203, A057957, A069061, A075708, A295501, A366602, A366604.
Cf. A075708, A366576, A366613, A366622, A366634, A366653, A366662, A102146, A366684, A366710.

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}.

Links

Crossrefs

Cf. A024049, A000203, A057956, A059887, A074479, A143665, A218357, A295502, A366611, A366612.
Cf. A075708, A366576, A366603, A366622, A366634, A366653, A366662, A102146, A366684, A366710.

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}.

Links

Crossrefs

Cf. A024075, A000203, A057954, A059887, A074249, A218358, A366632, A366633, A366635.
Cf. A075708, A366576, A366603, A366613, A366622, A366653, A366662, A102146, A366684, A366710.

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)).

A366660 Number of distinct prime divisors of 9^n - 1.

Original entry on oeis.org

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

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Links

Crossrefs

Cf. A024101, A001221, A057952, A366661, A366662, A366663.
Cf. A046800, A133801, A366604, A366611, A366620, A366632, A366651, A102347, A366681, A366707.

Programs

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

Formula

a(n) = omega(9^n-1) = A001221(A024101(n)).
a(n) = A133801(2*n) = A133801(n) + A366580(n) - 1. - Max Alekseyev, Jan 07 2024
Showing 1-10 of 11 results. Next

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

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