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

A379644 Smallest primitive prime factor of 11^n-1.

Original entry on oeis.org

2, 3, 7, 61, 3221, 37, 43, 7321, 1772893, 13421, 15797, 13, 1093, 1623931, 195019441, 17, 50544702849929377, 590077, 6115909044841454629, 212601841, 1723, 23, 829, 10657, 3001, 53, 5559917315850179173, 29, 523, 31, 50159, 51329, 661, 71707, 211, 3138426605161
Offset: 1

Views

Author

Sean A. Irvine, Dec 28 2024

Keywords

Comments

Also, smallest prime p such that 1/p has undecimal period n.

Crossrefs

Cf. A112927 (base 2), A143663 (base 3), A112092 (base 4), A143665 (base 5), A379639 (base 6), A379640 (base 7), A379641 (base 8), A379642 (base 9), A007138 (base 10), A379644 (base 11), A252170 (base 12).
Cf. A274910.

Programs

  • PARI
    listap(nn) = {prf = []; for (n=1, nn, vp = (factor(11^n-1)[, 1])~; f = setminus(Set(vp), Set(prf)); prf = concat(prf, f); print1(vecmin(Vec(f)), ", "); ); }

A366708 Number of prime factors of 12^n - 1 (counted with multiplicity).

Original entry on oeis.org

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

Views

Author

Sean A. Irvine, Oct 17 2023

Keywords

Crossrefs

Programs

  • Mathematica
    PrimeOmega[12^Range[70]-1]
  • PARI
    a(n)=bigomega(12^n-1)

Formula

a(n) = bigomega(12^n-1) = A001222(A024140(n)).
Previous Showing 11-12 of 12 results.