|
|
A355516
|
|
a(n) is the number of distinct integer values of Product_{k=1..n} (2 + 1/t_k) with integers t_k > 1.
|
|
2
|
|
|
|
OFFSET
|
2,2
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 1: The only representable integer is 5 = (2 + 1/3) * (2 + 1/7).
a(3) = 2: 9 and 11 can be represented; 9 = (2 + 1/9) * (2 + 1/13) * (2 + 1/19) and 10 other ways; 11 = (2 + 1/3)*(2 + 1/5)*(2 + 1/7) = (2 + 1/3)^2 * (2 + 1/49).
|
|
PROG
|
|
|
CROSSREFS
|
A355628 same problem with factors (3 + 1/t_k).
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|