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.

A328899 Numbers k such that the k-th repunit (10^k-1)/9 sets a new record for the number of distinct prime factors.

This page as a plain text file.
%I A328899 #21 Dec 18 2024 06:30:17
%S A328899 1,2,3,6,12,18,24,30,42,60,84,96,120,168,180,210,240,252,300,360,420,
%T A328899 630,660
%N A328899 Numbers k such that the k-th repunit (10^k-1)/9 sets a new record for the number of distinct prime factors.
%C A328899 The corresponding numbers of distinct prime factors are in A095371.
%C A328899 a(20) > 322.
%C A328899 From _Chai Wah Wu_, Oct 30 2019: (Start)
%C A328899 Since A095371(19) = 40, to show that a(20) > 323 we use the fact that (10^323-1)/9 is a product of 4 primes and a 271-digit composite number C. We then use a computer search to show that C has no prime factor <= floor(C^(1/(41-4))) = 19858291. This implies that (10^323-1)/9 has less than 41 distinct prime factors.
%C A328899 Applying this same approach to 337 and 353 (the only numbers between 323 and 359 for which the complete factorization of the corresponding repunit is not known) and using the factorization of (10^360-1)/9 with 44 distinct prime factors show that a(20) = 360 and A095371(20) = 44.
%C A328899 This approach also shows that a(21) = 420 and A095371(21) = 55. (End)
%C A328899 a(24) <= 840. Conjecture: a(24) = 840, a(25) = 1260, a(26) = 1680, a(27) = 1980, a(28) = 2520, a(29) = 3360, a(30) = 3780, a(31) = 3960, a(32) = 4620, a(33) = 5040, a(34) = 6300, a(35) = 7560, a(36) = 9240, a(37) = 10080. - _Chai Wah Wu_, Nov 01 2019
%t A328899 r[n_] := (10^n - 1)/9; L = {}; bst = -1; Do[v = PrimeNu[r[n]]; If[v > bst, bst = v; AppendTo[L, n]], {n, 60}]; L
%t A328899 (* or, based on the b-file of A095370: *)
%t A328899 w = Last /@ Cases[Import["https://oeis.org/A095370/b095370.txt", "Table"], {_Integer, _Integer}]; L={}; bst=-1; Do[If[w[[j]] > bst, AppendTo[L, j]; bst = w[[j]]], {j, Length@w}]; L
%Y A328899 Cf. A001221, A002275, A095370, A095371.
%K A328899 nonn,base,hard,more
%O A328899 1,2
%A A328899 _Giovanni Resta_, Oct 30 2019
%E A328899 a(20)-a(21) from _Chai Wah Wu_, Oct 30 2019
%E A328899 a(22)-a(23) from _Chai Wah Wu_, Nov 01 2019