OFFSET
1,1
COMMENTS
From Robert Israel, Apr 08 2025: (Start)
Numbers k such that k * (k + 6) = (10^d + 1) * m for some d and m where m has d digits.
Contains 10^d-5 for all d >= 1. (End)
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
f:= proc(d) local R, t, a, b, x, q;
t:= 10^d+1;
R:= NULL;
for a in numtheory:-divisors(t) do
b:= t/a;
if igcd(a, b) > 1 then next fi;
for x from chrem([0, -6], [a, b]) by t do
q:= x*(x+6)/t;
if q >= 10^d then break fi;
if q >= 10^(d-1) then R:= R, x fi;
od od;
sort([R]);
end proc:
seq(op(f(d)), d=1..10); # Robert Israel, Apr 08 2025
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Giovanni Resta, Feb 06 2006
EXTENSIONS
Name edited by Robert Israel, Apr 08 2025
STATUS
approved
