40313

Appears in sequences

• a(n) is the number consisting of the last n digits (although any leading 0's among those last n digits are omitted) of Sum_{j=1..k} j! for all sufficiently large k.at n=4A045748
• Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).at n=32A045941
• Numbers m such that the factorizations of m..m+5 have the same number of primes (including multiplicities).at n=5A045942
• A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes.at n=24A140763
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1110-1111 pattern in any orientation.at n=10A146741
• Number of permutations of [n] having no isolated entries. An entry j of a permutation p is isolated if it is not preceded by j-1 and not followed by j+1. For example, the permutation 23178564 has 2 isolated entries: 1 and 4.at n=15A180564
• G.f.: exp( Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^d)^n ).at n=15A205484
• Number of distinct characteristic polynomials of trees with n nodes.at n=17A226594
• Numbers in A007504 such that omega(a(n)) = Omega(a(n)) = 3.at n=20A264885
• Numbers n such that n, n + 1, n + 2, n + 3 and n + 4 are products of exactly three primes.at n=30A268588
• a(n) is the number of integers that can be represented in a 7-segment display by using only n segments (version A277116).at n=21A350440
• Expansion of (1/x) * Series_Reversion( x*(1-x+x^5) ).at n=11A366046
• Numbers k such that k, k+1, ..., k+5 all have 3 prime factors (counted with multiplicity).at n=5A375239
• Numbers k that are less than distance j from j! for some positive integer j.at n=48A387616