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 12 results. Next

A366714 Number of divisors of 12^n+1.

Original entry on oeis.org

2, 2, 4, 8, 4, 4, 8, 8, 8, 32, 12, 4, 16, 24, 16, 128, 4, 8, 32, 16, 64, 384, 64, 16, 64, 64, 32, 1024, 8, 8, 48, 8, 4, 512, 16, 32, 128, 16, 32, 1536, 16, 32, 64, 32, 16, 4096, 8, 32, 32, 32, 512, 512, 32, 32, 1024, 128, 512, 1536, 192, 64, 1024, 32, 64
Offset: 0

Views

Author

Sean A. Irvine, Oct 17 2023

Keywords

Examples

			a(4)=4 because 12^4+1 has divisors {1, 89, 233, 20737}.

Links

Crossrefs

Cf. A178248, A000005, A046798, A344897, A366709, A366712, A366713, A366715, A366716, A366719, A366720, A366688.

Programs

  • Maple
    a:=n->numtheory[tau](12^n+1):
seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[0, 12^Range[0, 70] + 1] (* Paolo Xausa, Apr 20 2025 *)
  • PARI
    a(n) = numdiv(12^n+1);

Formula

a(n) = sigma0(12^n+1) = A000005(A178248(n)).

A366716 a(n) = phi(12^n+1), where phi is Euler's totient function (A000010).

Original entry on oeis.org

1, 12, 112, 1296, 20416, 229680, 2306304, 32916240, 400515072, 3863116800, 47825825600, 685853880624, 8732596764672, 97509650382144, 990242755633152, 11148606564480000, 184883057981234176, 2047145911595946000, 20281543142263603200, 294779525244632305920
Offset: 0

Views

Author

Sean A. Irvine, Oct 17 2023

Keywords

Links

Crossrefs

Cf. A178248, A000010, A366711, A366712, A366713, A366714, A366715, A366719, A366720, A366690.

Programs

  • Mathematica
    EulerPhi[12^Range[0,19] + 1] (* Paul F. Marrero Romero, Oct 27 2023 *)
  • PARI
    {a(n) = eulerphi(12^n+1)}

Formula

a(n) = A000010(A178248(n)). - Paul F. Marrero Romero, Oct 27 2023

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

A366689 Sum of the divisors of 11^n+1.

Original entry on oeis.org

3, 28, 186, 3458, 21966, 375816, 2911272, 45470096, 340452396, 6278429920, 39543942612, 706019328000, 4708961513592, 82162955169792, 599236951715280, 11195197038864384, 68925937595777100, 1179397832668228992, 9136813499663186064, 144079834776308121600
Offset: 0

Views

Author

Sean A. Irvine, Oct 16 2023

Keywords

Examples

			a(4)=21966 because 11^4+1 has divisors {1, 2, 7321, 14642}.

Links

Crossrefs

Cf. A034524, A000203, A366666, A366684, A366686, A366687, A366688, A366690, A366715.

Programs

  • Maple
    a:=n->numtheory[sigma](11^n+1):
seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[1,11^Range[0,20]+1] (* Harvey P. Dale, Jun 22 2025 *)

Formula

a(n) = sigma(11^n+1) = A000203(A034524(n)).

A366607 Sum of the divisors of 4^n+1.

Original entry on oeis.org

3, 6, 18, 84, 258, 1302, 4356, 20520, 65538, 351120, 1110276, 5048232, 17041416, 82623888, 284225796, 1494039792, 4301668356, 20788904016, 73234343952, 332019460560, 1103789883396, 5936210280000, 18679788287496, 84884999116320, 282937726148616
Offset: 0

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(3)=84 because 4^3+1 has divisors {1, 5, 13, 65}.

Links

Crossrefs

Cf. A000203, A052539, A057940, A274903, A366603, A366605, A366606, A366608, A366609.
Cf. A069061, A366578, A366617, A366629, A366638, A366657, A366666, A366668, A366689, A366715.

Programs

  • Maple
    a:=n->numtheory[sigma](4^n+1):
seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[1,4^Range[0,30]+1] (* Paolo Xausa, Oct 14 2023 *)
  • Python
    from sympy import divisor_sigma
def A366607(n): return divisor_sigma((1<<(n<<1))+1) # Chai Wah Wu, Oct 14 2023

Formula

a(n) = sigma(4^n+1) = A000203(A052539(n)).
a(n) = A069061(2*n). - Max Alekseyev, Jan 08 2024

A366629 Sum of the divisors of 6^n+1.

Original entry on oeis.org

3, 8, 38, 256, 1298, 9792, 52136, 338580, 1778436, 11889152, 62367272, 414625216, 2178461956, 15224775552, 80673299432, 611106029568, 2830769440776, 19344856702976, 115255634181184, 696800841097536, 3748220725527432, 27388329197137920, 135183433256806480
Offset: 0

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(3)=256 because 6^3+1 has divisors {1, 7, 31, 217}.

Links

Crossrefs

Cf. A062394, A000203, A057938, A366622, A366617, A366627, A366628, A366630, A366670.
Cf. A069061, A366578, A366607, A366638, A366657, A366666, A366668, A366689, A366715.

Programs

  • Maple
    a:=n->numtheory[sigma](6^n+1):
seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[1, 6^Range[0, 30] + 1] (* Paolo Xausa, Jul 03 2024 *)

Formula

a(n) = sigma(6^n+1) = A000203(A062394(n)).

A366638 Sum of the divisors of 7^n+1.

Original entry on oeis.org

3, 15, 93, 660, 3606, 34560, 236964, 1559520, 9155916, 77423280, 530807472, 3868683120, 21224771760, 185094572580, 1261494915594, 9988783073280, 49990612274316, 436182213726030, 3279858902194056, 21372989348391720, 122709716651985624, 1082323574100172800
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

			a(4)=3606 because 7^4+1 has divisors {1, 2, 1201, 2402}.

Links

Crossrefs

Cf. A034491, A000203, A057937, A227575, A366634, A366636, A366637, A366639.
Cf. A069061, A366578, A366607, A366617, A366629, A366657, A366666, A366668, A366689, A366715.

Programs

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

Formula

a(n) = sigma(7^n+1) = A000203(A034491(n)).

A366719 Smallest prime dividing 12^n + 1.

Original entry on oeis.org

2, 13, 5, 7, 89, 13, 5, 13, 17, 7, 5, 13, 89, 13, 5, 7, 153953, 13, 5, 13, 41, 7, 5, 13, 17, 13, 5, 7, 89, 13, 5, 13, 769, 7, 5, 13, 89, 13, 5, 7, 17, 13, 5, 13, 89, 7, 5, 13, 7489, 13, 5, 7, 89, 13, 5, 13, 17, 7, 5, 13, 41, 13, 5, 7, 36097, 13, 5, 13, 89, 7
Offset: 0

Views

Author

Sean A. Irvine, Oct 17 2023

Keywords

Links

Crossrefs

Cf. A002586, A038371, A178248, A366712, A366713, A366714, A366715, A366716, A366717, A366720.

Programs

Formula

a(n) = A020639(A178248(n)). - Paul F. Marrero Romero, Oct 25 2023

A366617 Sum of the divisors of 5^n+1.

Original entry on oeis.org

3, 12, 42, 312, 942, 6264, 25284, 162000, 620460, 4961280, 16161768, 103442688, 367381884, 2441936064, 9859525284, 76963663296, 228970112844, 1526377433328, 6339280635408, 38199227335200, 144103649734968, 1285221510144000, 3894650946433800, 24349131482713344
Offset: 0

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Examples

			a(3)=312 because 5^3+1 has divisors {1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126}.

Links

Crossrefs

Cf. A000203, A034474, A057939, A074478, A366613, A366615, A366616, A366618.
Cf. A069061, A366578, A366607, A366629, A366638, A366657, A366666, A366668, A366689, A366715.

Programs

  • Maple
    a:=n->numtheory[sigma](5^n+1):
seq(a(n), n=0..100);
  • Mathematica
    DivisorSigma[1, 5^Range[0, 30] + 1] (* Paolo Xausa, Jul 03 2024 *)

Formula

a(n) = sigma(5^n+1) = A000203(A034474(n)).

A366657 Sum of the divisors of 8^n+1.

Original entry on oeis.org

3, 13, 84, 800, 4356, 51792, 351120, 3100240, 17041416, 211053040, 1494039792, 12611914848, 73234343952, 794382536272, 5936210280000, 60037292774400, 282937726148616, 3264911394064320, 24128875076496960, 208532141890460960, 1225825603154905104
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Examples

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

Links

Crossrefs

Cf. A062395, A000203, A057936, A274905, A366653, A366655, A366656, A366658.
Cf. A069061, A366578, A366607, A366617, A366629, A366638, A366666, A366668, A366689, A366715.

Programs

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

Formula

a(n) = sigma(8^n+1) = A000203(A062395(n)).
a(n) = A069061(3*n). - Max Alekseyev, Jan 09 2024
Showing 1-10 of 12 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.