35111

Properties

Appears in sequences

• Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.at n=11A050767
• Euclid-Mullin sequence (A000945) with initial value a(1)=41 instead of a(1)=2.at n=24A051317
• Prime(144*n).at n=25A102350
• Primes of the form (4k^2 + 4k - 5)/5.at n=24A154619
• Records in heights of cyclotomic polynomials (A160338).at n=19A160339
• Numerator of Laguerre(n, -8).at n=5A160603
• E.g.f.: 1/(1 + Sum_{n>=1} (-1)^n*x^(n*(3*n-1)/2)/(n*(3*n-1)/2)! + (-1)^n*x^(n*(3*n+1)/2)/(n*(3*n+1)/2)! ).at n=7A199746
• Prime numbers containing the string 111.at n=21A243527
• Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=8A259004
• Primes p such that 2*p+1 and (2*p)^2+(2*p+1)^2 are also prime.at n=37A347110
• Prime numbersat n=3744