67567

Properties

Appears in sequences

• Smallest prime > 2n+1 beginning and ending with 2n+1, or 0 if no such prime exists.at n=33A070278
• Number of anti-divisors of n (A066272) sets a record.at n=29A073638
• Lesser of a pair of records in A066272.at n=2A093071
• Numbers n such that Sum(1/d*_n)>Sum(1/d*_m) for all m<n, where d*_n and d*_m are the anti-divisors of n and m.at n=19A192294
• G.f.: (1+x)^(2*g)*(1+x^3)^(3*g)/((1-x^2)*(1-x^4))-x^(2*g)*(1+x)^4/((1-x^2)*(1-x^4)) for g=3.at n=30A199629
• a(n) = ((2*n-1)!! + (-1)^((n-1)*(n-2)/2))/2.at n=6A220092
• Primes of the form 2*n^2+66*n+31.at n=21A243957
• (A001147(n+1)-1)/2, equals the index of A249348(n) within the triangular numbers A000217.at n=6A249349
• Primes having only {5, 6, 7} as digits.at n=20A260829
• G.f. A(x,y) satisfies: A(x,y) = x + A( x^2 + x*y*A(x,y)^2, y).at n=70A271868
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=32A279139
• Triangle T(n,k) read by rows with T(n,0) = (2*n)! / (2^n * n!) for n >= 0 and T(n,k) = (Sum_{i=k..n} binomial(i-1,k-1) * 2^i * i! / (2*i)!) * (2*n)! / (2^n * n!) for 0 < k <= n.at n=30A350557
• Primes having only {0, 5, 6, 7} as digits.at n=41A386077
• Prime numbersat n=6732