38430
domain: N
Appears in sequences
- Number of 6-dimensional partitions of n.at n=8A000416
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 28.at n=13A031706
- Numbers whose set of base 14 digits is {0,1}.at n=18A033050
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Lah-triangle |A008297(n,k)|.at n=32A088729
- Given n colors, sequence gives number of ways to color the vertices of a square such that no edge has the same color on both of its vertices.at n=14A091940
- Triangle read by rows: T(n,k) is the number of alternating max-precedes-min permutations on [n+2] with 1 in position k+2, 0<=k<=n.at n=50A104346
- Numbers n such that p(8n) is prime, where p(n) is the number of partitions of n.at n=36A114168
- Triangle read by rows: T(n, k) = binomial(n, k)/Beta(n+1, n-k+1) + binomial(n, n-k)/Beta(n+1, k+1).at n=23A156052
- Triangle read by rows: T(n, k) = binomial(n, k)/Beta(n+1, n-k+1) + binomial(n, n-k)/Beta(n+1, k+1).at n=25A156052
- a(n) = 196*n^2 + 14.at n=14A158555
- Smallest number which is an unordered sum of two odd abundant numbers in exactly n ways.at n=27A187743
- Numbers n such that Sum_{i = 1..q} 1/d(i) is an integer where d(i) are the divisors of n for some q and n is primitive (the set {d(1), d(2), ..., d(q)} appears only once).at n=17A226853
- Number of partitions of n such that if the length is k then k is not a part.at n=41A229816
- Exponential Riordan array [1, 1/(2-e^x)-1].at n=41A256893
- Expansion of Product_{k>=1} (1 - x^(8*k))/(1 - x^k).at n=42A261775
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. Product_{i>0} 1/(Sum_{j=0..k} (-1)^j*x^(j*i)/j!).at n=62A293301
- Sum of all the parts in the partitions of n into 10 squarefree parts.at n=42A326627
- Expansion of Product_{k>=1} 1/((1 - x^k) * (1 - x^(2*k)) * (1 - x^(3*k))).at n=26A327042
- Numbers of the form ab such that uphi(ab) = a*b where ab is the concatenation of a and b.at n=38A337523
- a(n) = Sum_{p|n, p prime} n^pi(n/p).at n=13A369868