38745

Appears in sequences

• Coefficient of x^4 in (1-x-x^2)^(-n).at n=26A006504
• a(n) = C(n+6, 6) - n - 1.at n=14A062989
• Odd infinitary abundant numbers.at n=29A127666
• Odd doubly abundant numbers (A125639).at n=2A129087
• a(n) = A007318 * [1, 6, 14, 9, 0, 0, 0, ...].at n=29A143690
• Triangle read by rows, A100861(n,k) * A118930(k).at n=35A152685
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,2,4,1 for x=0,1,2,3,4.at n=8A196451
• a(n) = (n+1)*(n-2)*(n-3)/2.at n=42A212343
• Numbers n such that n+(n+1), n^2+(n+1)^2, n+(n+1)^2, n^2+(n+1) are all prime.at n=37A216270
• Number of labeled point-determining bipartite graphs on n vertices.at n=7A232699
• Number of weakly unimodal compositions of n with absolute difference of successive parts <= 1.at n=41A238871
• a(n) = number of primes less than the square root of the (2^n)-th prime.at n=33A249058
• Triangle of polynomials P(n,y) of order n in y, generated by the extension to the variable y of the e.g.f. of A259239(n), i.e., exp(y*(x-sqrt(1-x^2)+1)).at n=49A259286
• Number of set partitions of [n] such that the difference between each element and its block index is a multiple of eight.at n=28A274841
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=33A293186
• Number of minimum dominating sets in the n-triangular (Johnson) graph.at n=8A323499
• Numbers k such that the sum of the norm of divisors of k in Gaussian integers is divisible by k.at n=32A332736
• Number of ways to write n as an ordered sum of 7 primes.at n=36A340963
• Odd numbers k that are closer to being perfect than previous terms and also satisfy the condition that A324644(k)/A324198(k) = 2.at n=7A386422
• Nondeficient numbers k for which A324644(k)/A324198(k) = 2.at n=0A387165