The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A355629 a(n) is the number of tuples (t_1, ..., t_n) with integers 2 <= t_1 <= ... <= t_n such that 3^n + 1 = Product_{i = 1..n} (3 + 1/t_i). 6
 0, 2, 50, 9291 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..4. EXAMPLE a(2) = 2: 3^2 + 1 = 10 can be expressed as (3 + 1/4) * (3 + 1/13) and as (3 + 1/5) * (3 + 1/8); a(3) = 50: There are 50 representations of 3^3 + 1 = 28 with 10 <= min(t_i) <= 23 and 38 <= max(t_i) <= 8773. A product with minimal t_1 and maximal t_3 is 28 = (3 + 1/10) * (3 + 1/94) * (3 + 1/8773), maximal t_1 and minimal t_3 occur in 28 = (3 + 1/23) * (3 + 1/25) * (3 + 1/38). PROG (PARI) See A355626. CROSSREFS Cf. A034472, A355626, A355627, A355628, A355630, A355631. A356210 is the same problem with target 2^n + 1 and factors (2 + 1/t_k). Sequence in context: A274485 A210919 A210924 * A203766 A197487 A080293 Adjacent sequences: A355626 A355627 A355628 * A355630 A355631 A355632 KEYWORD bref,hard,more,nonn AUTHOR Markus Sigg, Jul 15 2022 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 1 03:55 EDT 2023. Contains 363068 sequences. (Running on oeis4.)