3263443

Properties

Appears in sequences

• Sylvester's sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(0) = 2.at n=5A000058
• Primes in Sylvester's sequence A000058.at n=4A014546
• Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (product{k=1 to m-1} t(k,n)) + (product{k=1 to n-1} t(m,k)).at n=29A124975
• Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (product{k=1 to m-1} t(k,n)) + (product{k=1 to n-1} t(m,k)).at n=34A124975
• List of primes generated by factoring successive integers in Sylvester's sequence (A000058).at n=6A126263
• A variant of Sylvester's sequence: a(0)=1 and for n>0, a(n) = (a(0)*a(1)*...*a(n-1)) + 1.at n=6A129871
• P_n(k) with P_0(z) = z+1 and P_n(z) = z + P_(n-1)(z)*(P_(n-1)(z)-z) for n>1; square array P_n(k), n>=0, k>=0, read by antidiagonals.at n=26A177888
• Prime numbers of the form k*(k+1) + (k*(k+1))^2 + 1.at n=12A255314
• Alternate version of A273317 with rows sorted in ascending order.at n=57A273338
• Smallest prime divisor of A000058(n) = A007018(n) + 1 (Sylvester's sequence).at n=5A323605
• a(n) = 1 + Product_{d|n, d < n} a(d).at n=31A343390
• Largest prime factor of A000058(n) = A007018(n) + 1 (Sylvester's sequence).at n=5A367020
• Sylvester primes. Yet another proof of the infinity of primes.at n=33A375543
• Prime numbersat n=234477