|
|
A325658
|
|
Brazilian composites of the form 1 + b + b^2 + b^3 + ... + b^k, b > 1, k > 1.
|
|
2
|
|
|
15, 21, 40, 57, 63, 85, 91, 111, 121, 133, 156, 183, 255, 259, 273, 341, 343, 364, 381, 400, 507, 511, 553, 585, 651, 703, 781, 813, 820, 871, 931, 993, 1023, 1057, 1111, 1191, 1261, 1333, 1365, 1407, 1464, 1555, 1561, 1641, 1807, 1885, 1893, 1981, 2047, 2071, 2163, 2257, 2353
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Composites that are repunits in base b >= 2 with three or more digits. If the Goormaghtigh conjecture is true, there are no composite numbers which can be represented as a string of three or more 1's in a base >= 2 in more than one way (A119598).
Only three known perfect powers belong to this sequence: 121, 343 and 400 (A208242).
Except for 121, each term of this sequence have also at least one Brazilian representation with only 2 digits.
|
|
LINKS
|
|
|
EXAMPLE
|
121 = (11111)_3, 133 = (111)_11 = (77)_18.
|
|
MAPLE
|
N:= 3000:
Res:= NULL:
for m from 2 while 1+m+m^2 <= N do
for k from 2 do
v:= (m^(k+1)-1)/(m-1);
if v > N then break fi;
if not isprime(v) then Res:= Res, v fi
od od:
|
|
PROG
|
(PARI) lista(nn) = {forcomposite(n=1, nn, for(b=2, sqrtint(n), my(d=digits(n, b), sd=Set(d)); if ((#d >= 3) && (#sd == 1) && (sd[1] == 1), print1(n, ", "); break); ); ); } \\ Michel Marcus, May 18 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|