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.
7531357568//7531357564 = 8678339452 * 8678339457, where // denotes concatenation.
q:= proc(d,m) 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,-m],[a,b]) by t do
q:= x*(x+m)/t;
if q >= 10^d then break fi;
if q >= 10^(d-1) then R:= R, x fi;
od od;
sort(convert({R},list));
end proc:
A:=[seq(op(q(d,2)),d=1..10)]; # Robert Israel, Apr 08 2025
from itertools import count, islice from sympy import sqrt_mod def A116288_gen(): # generator of terms for j in count(0): b = 10**j a = b*10+1 for k in sorted(sqrt_mod(4,a,all_roots=True)): if a*b <= k**2-4 < a*(a-1): yield k-2 A116288_list = list(islice(A116288_gen(),40)) # Chai Wah Wu, Feb 20 2024
89158934 * 89158937 = 79493157//79493158, where // denotes concatenation.
Comments