login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A340549 Smallest integer with exactly n divisors that are repunits. 10

%I #91 Sep 16 2022 05:32:47

%S 1,11,1111,111111,11222211,111111111111,1111222222221111,

%T 11223344555544332211,112244668899998866442211,

%U 112357025813567765307519653211,112244781144780011109977441077442211,113491945266228931047738906599340328084311,113378566812907968345622215431647587096554773311

%N Smallest integer with exactly n divisors that are repunits.

%C Previous name was: Integers whose number of divisors that are repunits sets a new record. From a(1) up to a(18), the terms of these two sequences are exactly the same.

%C From _Bernard Schott_, Jan 13 2022: (Start)

%C Repunit terms are: R_1, R_2, R_4, R_6, R_12, ... where R_m is A002275(m).

%C It appears that palindromes occur for n = 1 to 9 only. (End)

%C The indices of the n repunits that divide a(n) are given by the n-th row of A356184. - _Bernard Schott_, Sep 13 2022

%H Michel Marcus, <a href="/A340549/b340549.txt">Table of n, a(n) for n = 1..18</a>

%e 111111 has 4 divisors that are repunits: {1, 11, 111, 111111}; also, 111111 is the smallest integer that has at least 4 repunit divisors, hence 111111 is a term.

%e The 13 repunit divisors of a(13) are R_1, R_2, R_3, R_4, R_5, R_6, R_7, R_8, R_9, R_10, R_12, R_14 and R_18.

%t repQ[n_] := Union @ IntegerDigits[n] == {1}; seq[len_, nmax_] := Module[{s = Table[0, {len}], c = 0, n = 1, i}, While[c < len && n < nmax, i = DivisorSum[n, 1 &, repQ[#] &]; If[i <= len && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; seq[4, 10^7] (* _Amiram Eldar_, Sep 05 2022 *)

%o (PARI) upto(n) = { l = List(); ulim = n; res = []; reps = vector(logint(n, 10)-1, i, 10^(i+1)\9); for(i = 0, #reps, process(1, i); ); listsort(l, 1); r = 0; for(i = 1, #l, c = f(l[i]); if(c > #res, res = concat(res, vector(c - #res, j, oo)); ); res[c] = min(res[c], l[i]) ); res }

%o process(n, i) = { if(n <=ulim, listput(l, n); for(j = i + 1, #reps, c = lcm(n, reps[j]); process(c, j) ) ) }

%o f(n) = my(u = logint(n, 10) + 2); 1 + sum(i = 1, u, n % (10^(i+1)\9) == 0) \\ _David A. Corneth_, Jan 12 2021, Jan 17 2022, Sep 12 2022

%Y Cf. A002275, A083230, A083278, A308365, A339676, A356184.

%Y Similar, but with divisors that are: A087997 (palindromes), A355699 (repdigits).

%K nonn,base

%O 1,2

%A _Bernard Schott_, Jan 12 2021

%E a(5)-a(13) from _David A. Corneth_, Jan 12 2021

%E Definition modified by _Bernard Schott_, Sep 05 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 25 16:39 EDT 2024. Contains 375439 sequences. (Running on oeis4.)