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-9 of 9 results.

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

Original entry on oeis.org

1, 4, 16, 48, 256, 800, 3840, 12544, 65536, 186624, 986880, 3345408, 16515072, 52306176, 252645120, 760320000, 4288266240, 13628740608, 64258375680, 218462552064, 1095233372160, 3105655160832, 16510446886912, 56000724240384, 280012271910912, 869940000000000
Offset: 0

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Links

Crossrefs

Cf. A000010, A052539, A057940, A274903, A295501, A366605, A366606, A366607, A366609.
Cf. A053285, A366579, A366618, A366630, A366639, A366658, A366667, A366669, A366690, A366716.

Programs

  • Mathematica
    EulerPhi[4^Range[0,30]+1] (* Paolo Xausa, Oct 14 2023 *)
  • PARI
    {a(n) = eulerphi(4^n+1)}
  • Python
    from sympy import totient
def A366608(n): return totient((1<<(n<<1))+1) # Chai Wah Wu, Oct 14 2023

Formula

a(n) = A053285(2*n). - Max Alekseyev, Jan 08 2024

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

Original entry on oeis.org

1, 6, 36, 180, 1296, 6000, 41472, 230496, 1580800, 8359200, 58579200, 310968900, 2175102720, 10971642240, 76065091200, 351048600000, 2811459796992, 14508487949472, 88870766837760, 522016066337712, 3564233663616000, 17479898551382400, 128060205344805888
Offset: 0

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Links

Crossrefs

Cf. A062394, A000010, A366623, A366618, A366627, A366628, A366629, A366670.
Cf. A053285, A366579, A366608, A366639, A366658, A366667, A366669, A366690, A366716.

Programs

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

Formula

a(n) = A000010(A062394(n)). - Paul F. Marrero Romero, Oct 17 2023

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

Original entry on oeis.org

1, 4, 40, 288, 3072, 23600, 259200, 1847104, 21523360, 152845056, 1700870400, 12550120000, 130459631616, 997562438080, 11159367815680, 81159501312000, 926510094425920, 6670865700716544, 73205598106368000, 540340585126398016, 5691215305506816000
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Links

Crossrefs

Cf. A062396, A000010, A366663, A366664, A366665, A366666.
Cf. A053285, A366579, A366608, A366618, A366630, A366639, A366658, A366669, A366690, A366716.

Programs

  • Mathematica
    EulerPhi[9^Range[0, 20] + 1] (* Paul F. Marrero Romero, Nov 04 2023 *)
  • PARI
    {a(n) = eulerphi(9^n+1)}

Formula

a(n) = A000010(A062396(n)). - Paul F. Marrero Romero, Nov 04 2023
a(n) = A366579(2*n). - Max Alekseyev, Jan 08 2024

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

Original entry on oeis.org

1, 2, 12, 36, 312, 1040, 7200, 25088, 183808, 557928, 4396800, 15333120, 121680000, 406812744, 2817007200, 8558784000, 76264519680, 254230063200, 1710194342400, 6349120596480, 47334145996800, 127169887444992, 1088029470747648, 3889097389599864
Offset: 0

Views

Author

Sean A. Irvine, Oct 14 2023

Keywords

Links

Crossrefs

Cf. A000010, A034474, A057939, A074478, A295502, A366615, A366616, A366617.
Cf. A053285, A366579, A366608, A366630, A366639, A366658, A366667, A366669, A366690, A366716.

Programs

  • Mathematica
    EulerPhi[5^Range[0,30]+1] (* Harvey P. Dale, Jun 07 2025 *)
  • PARI
    {a(n) = eulerphi(5^n+1)}

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

Original entry on oeis.org

1, 4, 20, 168, 1200, 7600, 43200, 407680, 2712832, 19707408, 112560000, 945677920, 6768230400, 47530457728, 271289229120, 2096760960000, 16569393144832, 116315256993600, 597938524646400, 5699431359135360, 38890647857280000, 270061302781670400
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Links

Crossrefs

Cf. A034491, A000010, A057937, A227575, A366635, A366636, A366637, A366638.
Cf. A053285, A366579, A366608, A366618, A366630, A366658, A366667, A366669, A366690, A366716.

Programs

  • Mathematica
    EulerPhi[7^Range[0,21] + 1] (* Paul F. Marrero Romero, Nov 05 2023 *)
  • PARI
    {a(n) = eulerphi(7^n+1)}

Formula

a(n) = A000010(A034491(n)). - Paul F. Marrero Romero, Nov 06 2023

A366655 Number of distinct prime divisors of 8^n + 1.

Original entry on oeis.org

1, 1, 2, 2, 2, 3, 4, 3, 3, 3, 5, 4, 4, 3, 6, 5, 3, 5, 6, 4, 4, 5, 6, 4, 5, 6, 9, 6, 5, 4, 10, 4, 3, 7, 9, 10, 6, 6, 8, 5, 6, 6, 10, 5, 7, 9, 8, 6, 7, 6, 12, 9, 5, 5, 10, 10, 8, 6, 8, 7, 8, 3, 9, 10, 4, 10, 12, 7, 8, 6, 14, 7, 8, 5, 10, 10, 8, 11, 16, 5, 7, 10
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Links

Crossrefs

Cf. A062395, A001221, A057936, A274905, A366651, A366632, A366656, A366657, A366658, A366671.
Cf. A046799, A366580, A366605, A366615, A366627, A366636, A366664, A119704, A366686, A366712.

Programs

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

Formula

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

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

Links

Crossrefs

Cf. A062395, A000005, A057936, A274905, A366653, A366638, A366655, A366657, A366658.
Cf. A046798, A366577, A366606, A366616, A366628, A366637, A366665, A344897, A366688, A366714.

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

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

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

Original entry on oeis.org

1, 10, 100, 720, 9792, 90900, 990000, 9090900, 94117632, 681410880, 9897840000, 86925373920, 979102080000, 9080325951840, 95255567232000, 712493107200000, 9926748531589120, 90004044661864320, 989999010000000000, 9090909090909090900, 97910150554895155200
Offset: 0

Views

Author

Sean A. Irvine, Oct 15 2023

Keywords

Links

Crossrefs

Cf. A000010, A003021, A057934, A062397, A119704, A295503, A344897, A366668.
Cf. A053285, A366579, A366608, A366618, A366630, A366639, A366658, A366667, A366690, A366716.

Programs

  • Mathematica
    EulerPhi[10^Range[0,20] + 1] (* Paul F. Marrero Romero, Nov 10 2023 *)
  • PARI
    {a(n) = eulerphi(10^n+1)}

Formula

a(n) = A000010(A062397(n)). - Paul F. Marrero Romero, Nov 10 2023
Showing 1-9 of 9 results.

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

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