762986

Appears in sequences

• The n-th row of the following triangle contains n distinct numbers such that the product of (n-1) of them + 1 is always a prime. The first (n-1) numbers are the smallest set whose product +1 is a prime and the n-th term is chosen to satisfy the requirement. a(1) = 1 by convention. Sequence contains the triangle by rows.at n=35A083773
• Diagonal of A083773.at n=7A083774
• Continued fraction expansion of a constant x such that the n-th partial quotient equals a(n) = floor(2^n*x), with a(0)=1.at n=19A093053