A133801 -id:A133801 - cp's OEIS frontend

A057958 Number of prime factors of 3^n - 1 (counted with multiplicity).

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

Offset: 1

Patrick De Geest, Nov 15 2000

nonn

Max Alekseyev, Table of n, a(n) for n = 1..690 (first 660 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project

bigomega(b^n-1): A057951 (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), A057955 (b=6), A057956 (b=5), A057957 (b=4), this sequence (b=3), A046051 (b=2).

Cf. A001222, A024023, A085028, A002591 A074477, A057952, A133801, A274909.

a(n)=bigomega(3^n-1) \\ Charles R Greathouse IV, Sep 14 2015

Mobius transform of A085028. - T. D. Noe, Jun 19 2003

a(n) = A001222(A024023(n)). - Amiram Eldar, Feb 01 2020

Offset corrected by Amiram Eldar, Feb 01 2020

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

Patrick De Geest, Nov 15 2000

nonn

Max Alekseyev, Table of n, a(n) for n = 1..690 (first 330 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project

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.

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

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

A366707 Number of distinct prime divisors of 12^n - 1.

Original entry on oeis.org

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

Offset: 1

Sean A. Irvine, Oct 17 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..310

Cf. A024140, A001221, A046800, A133801, A102347, A250288, A252170, A366708, A366709, A366681.

for(n = 1, 100, print1(omega(12^n - 1), ", "))

a(n) = omega(12^n-1) = A001221(A024140(n)).

A366681 Number of distinct prime divisors of 11^n - 1.

Original entry on oeis.org

2, 3, 4, 4, 3, 6, 4, 5, 5, 5, 4, 9, 4, 6, 6, 7, 3, 8, 3, 7, 9, 9, 5, 12, 6, 8, 6, 10, 4, 11, 5, 9, 9, 7, 7, 12, 6, 8, 12, 10, 9, 13, 4, 12, 8, 10, 5, 18, 7, 10, 9, 10, 6, 11, 9, 15, 7, 8, 5, 16, 5, 10, 15, 12, 7, 19, 6, 12, 10, 15, 7, 18, 3, 9, 13, 11, 8, 20

Offset: 1

Sean A. Irvine, Oct 16 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..316

Cf. A024127, A001221, A274910, A366682, A366683, A366684, A366685.

Cf. A046800, A133801, A102347, A366707.

for(n = 1, 100, print1(omega(11^n - 1), ", "))

a(n) = omega(11^n-1) = A001221(A024127(n)).

A366580 Number of distinct prime divisors of 3^n + 1.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 3, 2, 3, 4, 3, 3, 3, 2, 4, 5, 2, 4, 4, 3, 3, 5, 4, 2, 6, 4, 4, 6, 4, 4, 5, 3, 2, 6, 4, 4, 4, 4, 4, 7, 5, 3, 7, 2, 5, 9, 4, 4, 4, 4, 6, 8, 4, 3, 5, 6, 6, 7, 4, 3, 7, 3, 5, 11, 2, 4, 6, 3, 5, 8, 8, 6, 8, 3, 5, 11, 6, 5, 7, 4, 5, 11, 5, 5, 10, 8

Offset: 0

Sean A. Irvine, Oct 13 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 0..691

Cf. A001221, A002592, A034472, A046799, A057935, A057941, A074476, A133801, A274909, A366577, A366578, A366579.

PrimeNu[3^Range[0,100]+1] (* Paolo Xausa, Oct 14 2023 *)

for(n = 0, 100, print1(omega(3^n + 1), ", "))

a(n) = omega(3^n+1) = A001221(A034472(n)).

A366620 Number of distinct prime divisors of 6^n - 1.

Original entry on oeis.org

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

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..430

Cf. A024062, A001221, A057955, A059888, A274907, A366621, A366622, A366623.

Cf. A046800, A133801, A366604, A366611, A366632, A366651, A366660, A102347, A366681, A366707.

for(n = 1, 100, print1(omega(6^n - 1), ", "))

a(n) = omega(6^n-1) = A001221(A024062(n)).

A366632 Number of distinct prime divisors of 7^n - 1.

Original entry on oeis.org

2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 4, 7, 3, 6, 6, 6, 4, 7, 4, 8, 6, 6, 5, 11, 5, 5, 9, 8, 5, 10, 5, 8, 8, 5, 7, 11, 5, 6, 7, 11, 5, 11, 4, 10, 10, 6, 4, 14, 8, 8, 9, 8, 5, 12, 6, 13, 8, 6, 6, 17, 6, 8, 9, 11, 9, 13, 6, 9, 9, 15, 4, 18, 7, 7, 10, 8, 9, 13, 4, 16, 13

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..388

Cf. A024075, A001221, A057954, A059889, A074249, A218358, A366620, A366633, A366634, A366635.

Cf. A046800, A133801, A366604, A366611, A366620, A366651, A366660, A102347, A366681, A366707.

for(n = 1, 100, print1(omega(7^n - 1), ", "))

a(n) = omega(7^n-1) = A001221(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

Sean A. Irvine, Oct 15 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..690

Cf. A024101, A001221, A057952, A366661, A366662, A366663.

Cf. A046800, A133801, A366604, A366611, A366620, A366632, A366651, A102347, A366681, A366707.

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

a(n) = omega(9^n-1) = A001221(A024101(n)).

a(n) = A133801(2*n) = A133801(n) + A366580(n) - 1. - Max Alekseyev, Jan 07 2024

A366604 Number of distinct prime divisors of 4^n - 1.

Original entry on oeis.org

1, 2, 2, 3, 3, 4, 3, 4, 4, 5, 4, 6, 3, 6, 6, 5, 3, 8, 3, 7, 6, 7, 4, 9, 7, 7, 6, 8, 6, 11, 3, 7, 8, 7, 9, 12, 5, 7, 7, 9, 5, 12, 5, 10, 11, 9, 6, 12, 5, 12, 10, 10, 6, 12, 11, 11, 8, 9, 6, 15, 3, 8, 11, 9, 9, 14, 5, 10, 8, 15, 6, 17, 6, 10, 13, 11, 10, 16, 5

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..1128

Cf. A024036, A001221, A057957, A133801, A366602, A366603.

Cf. A046800, A133801, A366611, A366620, A366632, A366651, A366660, A102347, A366681, A366707.

PrimeNu[4^Range[100]-1] (* Paolo Xausa, Oct 14 2023 *)

for(n = 1, 100, print1(omega(4^n - 1), ", "))

from sympy import primenu
def A366604(n): return primenu((1<<(n<<1))-1) # Chai Wah Wu, Oct 15 2023

a(n) = omega(4^n-1) = A001221(A024036(n)).

a(n) = A046800(2*n) = A046799(n) + A046800(n). - Max Alekseyev, Jan 07 2024

A366651 Number of distinct prime divisors of 8^n - 1.

Original entry on oeis.org

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

Offset: 1

Sean A. Irvine, Oct 15 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..500

Cf. A024088, A001221, A057953, A366652, A366653, A366654.

Cf. A046800, A133801, A366604, A366611, A366620, A366632, A366660, A102347, A366681, A366707.

for(n = 1, 100, print1(omega(8^n - 1), ", "))

a(n) = omega(8^n-1) = A001221(A024088(n)).

a(n) = A046800(3*n). - Max Alekseyev, Jan 09 2024

cp's OEIS Frontend

A057958 Number of prime factors of 3^n - 1 (counted with multiplicity).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

Extensions

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A366707 Number of distinct prime divisors of 12^n - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A366681 Number of distinct prime divisors of 11^n - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A366580 Number of distinct prime divisors of 3^n + 1.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A366620 Number of distinct prime divisors of 6^n - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A366632 Number of distinct prime divisors of 7^n - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

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

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A366604 Number of distinct prime divisors of 4^n - 1.

Views

Author

Keywords

Links