OFFSET
0,1
LINKS
Robert Israel, Table of n, a(n) for n = 0..10000
FORMULA
From Robert Israel, Jul 19 2026: (Start)
EXAMPLE
Sequence:....1111....6...205...427...1577....11639....1651..
Factors.:..101*11..2*3..41*5..61*7..83*19..103*113..127*13..
2n, 2n+1:.....0,1..2,3...4,5...6,7....8,9....10,11...12,13..
n ......:.......0....1.....2.....3......4........5.......6..
MAPLE
f:= proc(n) local d, m, m1, i, j, Cands, y;
d:= 1 + ilog10(n);
if isprime(n) and not member(n, Used) then return n fi;
for m from 1 do
if member(n mod 10, [1, 3, 7, 9]) then Cands:= seq(i*10^d+n, i=10^(m-1)..10^m-1)
else Cands:= NULL
fi;
Cands:= sort([Cands, seq(10^m*n+i, i=1..10^m-1, 2),
seq(seq(seq(10^(m1+d)*i + 10^m1*n+j, i=10^(m-m1-1)..10^(m-m1)-1), j=1..10^m1-1, 2),
m1=1..m-1) ]);
for y in Cands do if ListTools:-BinarySearch(Used, y) = 0 and isprime(y) then return y fi;
od od;
end proc:
Used:= [101, 11]: R:= 1111:
for n from 1 to 100 do
v:= f(2*n);
w:= f(2*n+1);
R:= R, v*w;
j:= ListTools:-BinaryPlace(Used, v);
Used:= [op(Used[1..j]), v, op(Used[j+1..-1])];
j:= ListTools:-BinaryPlace(Used, w);
Used:= [op(Used[1..j]), w, op(Used[j+1..-1])];
od:
R; # Robert Israel, Jul 19 2026
CROSSREFS
KEYWORD
base,nonn,changed
AUTHOR
Jason Earls, Aug 22 2003
EXTENSIONS
More terms from Ray Chandler, Aug 31 2003
More terms from Robert Israel, Jul 19 2026
STATUS
approved
