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

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

Original entry on oeis.org

1, 4, 60, 432, 7320, 53680, 803520, 6495720, 100874752, 764738496, 12756110400, 89493288192, 1568774615040, 11278053084480, 180228847518720, 1310982643872000, 22974417331646464, 168479281019744640, 2521788545778163200, 20190830281379049600
Offset: 0

Views

Author

Sean A. Irvine, Oct 16 2023

Keywords

Crossrefs

Programs

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

Formula

a(n) = A000010(A034524(n)). - Paul F. Marrero Romero, Nov 10 2023

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

Original entry on oeis.org

10, 120, 1560, 13440, 226200, 2021760, 32518360, 274391040, 4534807680, 51953616000, 646094232960, 4662793175040, 97266341877120, 1070382142166400, 13666309113600000, 109897747141754880, 2016918439151095000, 17518491733377024000, 290436363064202660760
Offset: 1

Views

Author

Sean A. Irvine, Oct 17 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), A366654 (k=8), A366663 (k=9), A295503 (k=10), A366685 (k=11), this sequence (k=12).

Programs

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

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

Original entry on oeis.org

6, 60, 648, 6000, 64800, 466560, 6637344, 58752000, 648646704, 5890320000, 66663457344, 461894400000, 6458084523072, 60339430569600, 610154104320000, 5529599115264000, 66666634474902192, 441994921381739520, 6666666666666666660, 58301444908800000000
Offset: 1

Views

Author

Seiichi Manyama, Nov 22 2017

Keywords

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), A366663 (k=9), this sequence (k=10), A366685 (k=11), A366711 (k=12).

Programs

  • Mathematica
    Array[ EulerPhi[10^# - 1] &, 20] (* Robert G. Wilson v, Nov 22 2017 *)
  • PARI
    {a(n) = eulerphi(10^n-1)}

Formula

a(n) = n*A295497(n).
a(n) = A000010(A002283(n)). - Michel Marcus, Nov 25 2017

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