OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
h:= proc(L) local m, x, i, t;
m:= nops(L)+1;
x:= m/2 - add(1/t, t=L);
if x > 0 then
x:= 1/x;
if x::posint and x <= 9 then
return(x + add(L[i]*10^i, i=1..m-1))
fi fi
end proc:
f:= n -> h(map(`+`, convert(n, base, 9), 1)):
g:= n -> h([op(map(`+`, convert(n, base, 9), 1)), 1]):
R:= 2:
for d from 1 to 4 do
R:= R, seq(f(i), i=9^(d-1)..9^d-1), seq(g(i), i=9^(d-1)..9^d-1)
od:
R; # Robert Israel, Apr 05 2021
MATHEMATICA
Do[ h = IntegerDigits[n]; If[ Sort[h][[1]] != 0 && Length[h]/Apply[Plus, 1/h] == 2, Print[n]], {n, 1, 10^4}]
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Vladeta Jovovic, Jun 12 2001
EXTENSIONS
More terms from Henry Bottomley, Jul 25 2001
STATUS
approved