30031

Appears in sequences

• Euclid numbers: 1 + product of the first n primes.at n=6A006862
• Numbers k such that k*(k+8) is a palindrome.at n=19A028567
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 85 ones.at n=0A031853
• Expansion of 1/((1-x)*(1-x^2)^2*(1-x^3)^2*(1-x^4)^2*(1-x^5)*(1-x^6)).at n=32A045513
• Composite Euclid numbers: numbers of the form p# + 1, where p# denotes the primorial of the prime p.at n=0A066576
• Smallest composite number == 1 mod first n prime numbers.at n=5A075064
• Smallest composite number which is 1 more than the product of n distinct primes.at n=5A081548
• 4-Smith numbers.at n=30A103125
• Semiprimes of the form primorial(k) + 1.at n=0A104877
• E.g.f. satisfies A(x) = exp(x*A(x^9/9!)).at n=15A143573
• Triangle read by rows: the n-th Euclid number followed by the first n primes and 1.at n=27A162387
• Sums of 2 distinct primorials.at n=14A177689
• Smallest m such that the n-th odd prime is the smallest prime for all decompositions of 2*m into two primes.at n=44A208662
• Number of (n+6)X9 0..1 matrices with each 7X7 subblock idempotent.at n=7A224583
• Number of compositions of n into parts 1, 6, and 7.at n=36A259278
• Pseudoprimes to base 5, written in base 5.at n=7A262102
• a(n) is the smallest number k such that phi(k) >= n*phi(k-1).at n=4A266269
• Primorial base log-function: fully additive with a(p) = p#/p, where p# = A034386(p).at n=33A276085
• Numbers obtained by reinterpreting base-2 representation of n in primorial base: a(0) = 0, a(2n) = A276154(a(n)), a(2n+1) = 1 + A276154(a(n)).at n=65A276156
• Composite numbers that divide at least one Euclid number.at n=6A297894