OFFSET
1,2
MAPLE
a:= proc(n) option remember; local f; f:=
proc(m) option remember; `if`(m=1, {n}, {
seq(seq(seq([x+y, x-y, x*y, `if`(y=0, [][], x/y)
][], y=f(m-j)), x=f(j)), j=1..m-1)})
end; forget(f);
nops([select(z->z>=0 and is(z, integer), f(n))[]])
end:
seq(a(n), n=1..9);
MATHEMATICA
a[n_] := a[n] = Module[{f}, f[m_] := f[m] = If[m == 1, {n},
Union@ Flatten@ Table[Table[Table[{x + y, x - y, x*y,
If[y == 0, Nothing, x/y]}, {y, f[m-j]}], {x, f[j]}], {j, m-1}]];
Length[Select[f[n], # >= 0 && IntegerQ[#]&]]];
Table[a[n], {n, 1, 9}] (* Jean-François Alcover, Aug 29 2021, after Alois P. Heinz *)
PROG
(Python)
from fractions import Fraction
from functools import lru_cache
def a(n):
@lru_cache()
def f(m):
if m == 1: return {Fraction(n, 1)}
out = set()
for j in range(1, m):
for x in f(j):
for y in f(m-j):
out.update([x + y, x - y, x * y])
if y: out.add(Fraction(x, y))
return list(out)
return sum(num >= 0 and num.denominator == 1 for num in f(n))
print([a(n) for n in range(1, 10)]) # Michael S. Branicky, Aug 29 2021 after Alois P. Heinz
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Alois P. Heinz, May 19 2015
EXTENSIONS
a(13)-a(14) from Giovanni Resta, May 20 2015
a(15) from Michael S. Branicky, Aug 29 2021
STATUS
approved