34049

Appears in sequences

• Numbers k such that k = p+q = r+s with p*q = r*s = primorial number(A002110) (p*q) < (r*s).at n=4A057230
• Expansion of g.f.: (1+2*x^3+2*x^6)/((1-x)*(1-x-x^2+x^3-x^4-x^5+x^6)).at n=21A084683
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, 0, 1)}.at n=10A148651
• a(n) = 1+2*(d1 + 1)*(d2 + 1)*...*(dk + 1), where d1, d2, ..., dk are the prime factors of the n-th Fermat pseudoprime to base 2 A001567(n).at n=26A216646
• a(n) = Fibonacci(p) mod p^2, where p = prime(n).at n=48A236395
• Numbers k such that (8*10^k - 77)/3 is prime.at n=26A272929
• Array read by antidiagonals: T(m,n) = number of irredundant sets in the grid graph P_m X P_n.at n=31A286868
• Array read by antidiagonals: T(m,n) = number of irredundant sets in the grid graph P_m X P_n.at n=32A286868
• Number of equal-length matchings of 2n uniformly spaced points on a circle.at n=29A381194