510511

Appears in sequences

• Euclid numbers: 1 + product of the first n primes.at n=7A006862
• Composite Euclid numbers: numbers of the form p# + 1, where p# denotes the primorial of the prime p.at n=1A066576
• Smallest composite number == 1 mod first n prime numbers.at n=6A075064
• Smallest number == 0 mod (n+1)-th prime and == 1 mod all smaller primes.at n=6A075306
• Smallest composite number which is 1 more than the product of n distinct primes.at n=6A081548
• Triangle read by rows: the n-th Euclid number followed by the first n primes and 1.at n=35A162387
• Sums of 2 distinct primorials.at n=20A177689
• Euclid numbers (A006862) of the form 3*(i*i + i*j + j*j + i + j) + 1 where i and j are integers.at n=4A261558
• Primorial base log-function: fully additive with a(p) = p#/p, where p# = A034386(p).at n=37A276085
• Composite numbers that divide at least one Euclid number.at n=10A297894
• A276085 applied to the intersection of A048103 (p^p-free numbers) and A276156 (sums of distinct primorials).at n=10A328833
• Numbers k such that A276086(k) is a sum of distinct primorial numbers.at n=15A328836
• Triangle read by rows: T(n,k) = A002110(n) + A002110(k), 0 <= k <= n; sums of two primorials, not necessarily distinct.at n=28A370121
• Highly touchable numbers sandwiched between untouchable twin pairs.at n=8A370355
• a(n) = A276085(A048103(n)), where A276085 is the primorial base log-function, and A048103 is the range of the primorial base exp-function (A276086).at n=27A376413
• Numbers k such that A380459(A276086(k)) has no divisors of the form p^p, for any prime p.at n=12A392603