28357

Appears in sequences

• Exponential generating function x*exp(x/(1-x)).at n=6A006152
• a(n)-th prime is sum of first k primes for some k.at n=32A020641
• a(n) = (A001333(n+1) - 2*A005409(floor((n+3)/2)) - 1) / 4.at n=12A107769
• Exponential Riordan array [e^(x/(1-x)),x].at n=29A129652
• Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.at n=29A206703
• Number of ways to put n labeled objects into n labeled boxes so that no two nonempty boxes are adjacent.at n=7A219614
• Number of n X n 0..1 arrays with every element equal to 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=9A298174
• Number T(n,k) of proper multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=2, 1<=k<=n-1, read by rows.at n=27A320264
• The index of prime(n) in A337182.at n=32A338222
• Numbers m such that numbers m, m + 1, m + 2 and m + 3 have k, 2k, 3k and 4k divisors respectively.at n=18A340157
• Numbers k such that k, k+1, k+2, k+3 have 2, 3, 4, 5 prime factors respectively, counted with multiplicity.at n=39A363391