[go: up one dir, main page]

login
Search: a057952 -id:a057952
     Sort: relevance | references | number | modified | created      Format: long | short | data
Number of prime factors of Mersenne number M(n) = 2^n - 1 (counted with multiplicity).
+10
45
0, 1, 1, 2, 1, 3, 1, 3, 2, 3, 2, 5, 1, 3, 3, 4, 1, 6, 1, 6, 4, 4, 2, 7, 3, 3, 3, 6, 3, 7, 1, 5, 4, 3, 4, 10, 2, 3, 4, 8, 2, 8, 3, 7, 6, 4, 3, 10, 2, 7, 5, 7, 3, 9, 6, 8, 4, 6, 2, 13, 1, 3, 7, 7, 3, 9, 2, 7, 4, 9, 3, 14, 3, 5, 7, 7, 4, 8, 3, 10, 6, 5, 2, 14, 3, 5, 6, 10, 1, 13, 5, 9, 3, 6, 5, 13, 2, 5, 8
OFFSET
1,4
COMMENTS
Length of row n of A001265.
LINKS
Sean A. Irvine, Table of n, a(n) for n = 1..1206 (terms 1..500 from T. D. Noe)
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
Alex Kontorovich, Jeff Lagarias, On Toric Orbits in the Affine Sieve, arXiv:1808.03235 [math.NT], 2018.
S. S. Wagstaff, Jr., The Cunningham Project
Eric Weisstein's World of Mathematics, Mersenne Number
FORMULA
Mobius transform of A085021. - T. D. Noe, Jun 19 2003
a(n) = A001222(A000225(n)). - Michel Marcus, Jun 06 2019
EXAMPLE
a(4) = 2 because 2^4 - 1 = 15 = 3*5.
From Gus Wiseman, Jul 04 2019: (Start)
The sequence of Mersenne numbers together with their prime indices begins:
1: {}
3: {2}
7: {4}
15: {2,3}
31: {11}
63: {2,2,4}
127: {31}
255: {2,3,7}
511: {4,21}
1023: {2,5,11}
2047: {9,24}
4095: {2,2,3,4,6}
8191: {1028}
16383: {2,14,31}
32767: {4,11,36}
65535: {2,3,7,55}
131071: {12251}
262143: {2,2,2,4,8,21}
524287: {43390}
1048575: {2,3,3,5,11,13}
(End)
MATHEMATICA
a[q_] := Module[{x, n}, x=FactorInteger[2^n-1]; n=Length[x]; Sum[Table[x[i][2], {i, n}][j], {j, n}]]
a[n_Integer] := PrimeOmega[2^n - 1]; Table[a[n], {n, 200}] (* Vladimir Joseph Stephan Orlovsky, Jul 22 2011 *)
PROG
(PARI) a(n)=bigomega(2^n-1) \\ Charles R Greathouse IV, Apr 01 2013
CROSSREFS
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), A057958 (b=3), this sequence (b=2).
KEYWORD
nonn
STATUS
approved
Number of prime factors of 10^n - 1 (counted with multiplicity).
+10
26
2, 3, 4, 4, 4, 7, 4, 6, 6, 6, 4, 9, 5, 6, 8, 8, 4, 11, 3, 9, 9, 9, 3, 12, 7, 8, 9, 10, 7, 15, 5, 13, 8, 8, 9, 14, 5, 5, 8, 13, 6, 17, 6, 13, 12, 8, 4, 15, 6, 12, 10, 11, 6, 16, 10, 14, 8, 10, 4, 22, 9, 7, 16, 17, 9, 17, 5, 12, 8, 14, 4, 20, 5, 9, 14, 8, 10, 18
OFFSET
1,1
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..352 (first 322 terms from Ray Chandler)
S. S. Wagstaff, Jr., Main Tables from the Cunningham Project.
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Mobius transform of A085035 - T. D. Noe, Jun 19 2003
a(n) = Omega(10^n -1) = Omega(R_n) + 2 = A046053(n) + 2 {where Omega(n) = A001222(n) and R_n = (10^n - 1)/9 = A002275(n)}. - Lekraj Beedassy, Jun 09 2006
a(n) = A001222(A002283(n)). - Ray Chandler, Apr 22 2017
MATHEMATICA
PrimeOmega[10^Range[70]-1] (* Jayanta Basu, May 29 2013 *)
PROG
(PARI) a(n)=bigomega(10^n-1) \\ Charles R Greathouse IV, Sep 14 2015
CROSSREFS
bigomega(b^n-1): this sequence (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), A057955 (b=6), A057956 (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
EXTENSIONS
Erroneous b-file replaced by Ray Chandler, Apr 26 2017
STATUS
approved
Number of prime factors of 3^n - 1 (counted with multiplicity).
+10
22
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,2
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..690 (first 660 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Mobius transform of A085028. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024023(n)). - Amiram Eldar, Feb 01 2020
PROG
(PARI) a(n)=bigomega(3^n-1) \\ Charles R Greathouse IV, Sep 14 2015
CROSSREFS
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).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
EXTENSIONS
Offset corrected by Amiram Eldar, Feb 01 2020
STATUS
approved
Number of prime factors of 7^n - 1 (counted with multiplicity).
+10
19
2, 5, 4, 8, 3, 8, 4, 10, 7, 8, 4, 13, 3, 9, 7, 13, 4, 12, 4, 14, 7, 9, 5, 18, 5, 8, 12, 13, 5, 14, 5, 16, 9, 8, 7, 18, 5, 9, 8, 18, 5, 15, 4, 15, 12, 9, 4, 22, 8, 11, 10, 13, 5, 18, 6, 19, 10, 9, 6, 24, 6, 11, 11, 20, 9, 17, 6, 14, 10, 18, 4, 26, 7, 10, 11, 13, 9, 17, 4, 24, 17, 12, 9, 22
OFFSET
1,1
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..388 (first 378 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Möbius transform of A085032. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024075(n)). - Amiram Eldar, Feb 02 2020
EXAMPLE
7^8-1 = 5764800 = 2^6 * 3 * 5^2 * 1201 and a(8) = bigomega(5764800) = 6+1+2+1 = 10. - Bernard Schott, Feb 02 2020
MATHEMATICA
PrimeOmega[Table[7^n - 1, {n, 1, 30}]] (* Amiram Eldar, Feb 02 2020 *)
PROG
(Magma) f:=func<n|&+[p[2]: p in Factorization(n)]>; [f(7^n- 1):n in [1..85]]; // Marius A. Burtea, Feb 02 2020
CROSSREFS
bigomega(b^n-1): A057951 (b=10), A057952 (b=9), A057953 (b=8), this sequence (b=7), A057955 (b=6), A057956 (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
STATUS
approved
Number of prime factors of 4^n - 1 (counted with multiplicity).
+10
19
1, 2, 3, 3, 3, 5, 3, 4, 6, 6, 4, 7, 3, 6, 7, 5, 3, 10, 3, 8, 8, 7, 4, 10, 7, 7, 9, 8, 6, 13, 3, 7, 9, 7, 9, 14, 5, 7, 8, 10, 5, 14, 5, 10, 13, 9, 6, 13, 5, 14, 11, 10, 6, 15, 12, 11, 9, 9, 6, 17, 3, 8, 14, 9, 9, 15, 5, 11, 9, 16, 6, 19, 6, 10, 14, 11, 10, 18, 5, 13, 16, 10, 8, 19, 7, 10, 11
OFFSET
1,2
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..1122 (first 603 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Mobius transform of A085029. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024036(n)) = A046051(2*n). - Amiram Eldar, Feb 01 2020
MATHEMATICA
PrimeOmega/@(4^Range[90]-1) (* Harvey P. Dale, Dec 31 2018 *)
CROSSREFS
bigomega(b^n-1): A057951 (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), A057955 (b=6), A057956 (b=5), this sequence (b=4), A057958 (b=3), A046051 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
STATUS
approved
Number of prime factors of 9^n + 1 (counted with multiplicity).
+10
18
2, 2, 3, 3, 4, 3, 4, 2, 4, 3, 4, 6, 4, 4, 6, 2, 4, 4, 4, 5, 7, 5, 4, 4, 8, 4, 5, 6, 4, 7, 5, 2, 6, 5, 9, 8, 5, 6, 7, 5, 5, 10, 7, 6, 9, 4, 4, 6, 9, 6, 8, 7, 6, 9, 8, 9, 9, 5, 3, 11, 6, 4, 11, 6, 8, 9, 9, 8, 6, 9, 5, 6, 6, 6, 13, 4, 8, 7, 5, 4, 7, 6, 5, 11, 8, 5, 8, 7, 4, 11, 7, 9, 9, 5, 9, 7, 5, 6, 10, 7, 6
OFFSET
1,1
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..345 (first 329 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
a(n) = A057952(2n) - A057952(n). - T. D. Noe, Jun 19 2003
a(n) = A001222(A062396(n)) = A057941(2*n). - Amiram Eldar, Feb 02 2020
MATHEMATICA
PrimeOmega[Table[9^n + 1, {n, 1, 30}]] (* Amiram Eldar, Feb 02 2020 *)
PROG
(Magma) f:=func<n|&+[p[2]: p in Factorization(n)]>; [f(9^n + 1):n in [1..100]]; // Marius A. Burtea, Feb 02 2020
CROSSREFS
bigomega(b^n+1): A057934 (b=10), this sequence (b=9), A057936 (b=8), A057937 (b=7), A057938 (b=6), A057939 (b=5), A057940 (b=4), A057941 (b=3), A054992 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Oct 15 2000
STATUS
approved
Number of prime factors of 8^n - 1 (counted with multiplicity).
+10
18
1, 3, 2, 5, 3, 6, 4, 7, 3, 7, 4, 10, 4, 8, 6, 10, 5, 9, 4, 13, 7, 9, 4, 14, 7, 8, 6, 14, 6, 13, 3, 13, 8, 11, 11, 15, 6, 9, 9, 17, 5, 14, 5, 15, 10, 9, 6, 19, 7, 14, 8, 18, 8, 16, 10, 19, 7, 11, 6, 24, 5, 8, 10, 16, 8, 17, 6, 20, 9, 22, 7, 21, 7, 13, 14, 17, 10, 16, 8, 23, 10, 12, 5, 24
OFFSET
1,2
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..500 (first 402 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Mobius transform of A085033. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024088(n)) = A046051(3*n). - Amiram Eldar, Feb 02 2020
MATHEMATICA
PrimeOmega/@(8^Range[90]-1) (* Harvey P. Dale, May 24 2018 *)
PROG
(Magma) f:=func<n|&+[p[2]: p in Factorization(n)]>; [f(8^n - 1):n in [1..90]]; // Marius A. Burtea, Feb 02 2020
CROSSREFS
bigomega(b^n-1): A057951 (b=10), A057952 (b=9), this sequence (b=8), A057954 (b=7), A057955 (b=6), A057956 (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
STATUS
approved
Number of prime factors of 6^n - 1 (counted with multiplicity).
+10
17
1, 2, 2, 3, 3, 4, 2, 4, 4, 6, 3, 7, 3, 6, 6, 6, 5, 7, 3, 9, 4, 5, 5, 9, 6, 7, 6, 9, 2, 11, 3, 9, 6, 8, 7, 13, 6, 6, 6, 12, 3, 10, 5, 9, 11, 8, 4, 13, 5, 10, 9, 11, 4, 11, 7, 14, 7, 6, 4, 20, 4, 5, 10, 12, 9, 12, 3, 11, 8, 18, 2, 18, 5, 10, 12, 9, 6, 15, 4, 17, 8, 7, 8, 17, 10, 7, 7, 12, 4, 18, 6
OFFSET
1,2
LINKS
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Möbius transform of A085031. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024062(n)). - Amiram Eldar, Feb 02 2020
EXAMPLE
6^10 - 1 = 60466175 = 5^2 * 7 * 11 * 101 * 311 and a(10) = bigomega(60466175) = 2+1+1+1+1 = 6. - Bernard Schott, Feb 02 2020
MATHEMATICA
PrimeOmega[6^Range[100]-1] (* Harvey P. Dale, Dec 14 2015 *)
PROG
(Magma) f:=func<n|&+[p[2]: p in Factorization(n)]>; [f(6^n - 1):n in [1..90]]; // Marius A. Burtea, Feb 02 2020
CROSSREFS
bigomega(b^n-1): A057951 (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), this sequence (b=6), A057956 (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
STATUS
approved
Number of prime factors of 5^n - 1 (counted with multiplicity).
+10
17
2, 4, 3, 6, 4, 7, 3, 8, 5, 7, 3, 10, 3, 7, 7, 11, 4, 11, 5, 11, 6, 8, 4, 13, 8, 7, 9, 10, 5, 14, 4, 14, 6, 8, 9, 16, 5, 10, 6, 15, 4, 16, 4, 12, 12, 8, 3, 17, 4, 13, 8, 12, 5, 19, 10, 13, 7, 9, 4, 21, 5, 9, 11, 18, 8, 15, 7, 14, 9, 16, 4, 22, 5, 10, 16, 14, 7, 14, 5, 20, 11, 10, 5, 22, 9, 10
OFFSET
1,1
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..502 (first 448 terms from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project
FORMULA
Mobius transform of A085030. - T. D. Noe, Jun 19 2003
a(n) = A001222(A024049(n)). - Amiram Eldar, Feb 01 2020
MATHEMATICA
PrimeOmega[5^Range[90]-1] (* Harvey P. Dale, Dec 16 2017 *)
CROSSREFS
bigomega(b^n-1): A057951 (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), A057955 (b=6), this sequence (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).
KEYWORD
nonn
AUTHOR
Patrick De Geest, Nov 15 2000
STATUS
approved
a(n) = phi(9^n-1), where phi is Euler's totient function (A000010).
+10
14
4, 32, 288, 2560, 26400, 165888, 2384928, 15728640, 141087744, 1246080000, 14758128000, 85996339200, 1270928131200, 8810420097024, 70207948800000, 677066362060800, 8218041445152000, 43129128265187328, 674757689572915200, 4238841176064000000
OFFSET
1,1
LINKS
FORMULA
a(n) = A295500(2*n) = 2 * A295500(n) * A366579(n). - Max Alekseyev, Jan 07 2024
MATHEMATICA
EulerPhi[9^Range[30] - 1]
PROG
(PARI) {a(n) = eulerphi(9^n-1)}
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), this sequence (k=9), A295503 (k=10), A366685 (k=11), A366711 (k=12).
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Oct 15 2023
STATUS
approved

Search completed in 0.009 seconds