40140

Appears in sequences

• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=9.at n=32A135194
• Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array.at n=29A219774
• Triangle with first column identical to 1 and the other entries defined by the sum of entries above and to the left.at n=42A226392
• Number T(n,k) of endofunctions on [n] such that at least one preimage with cardinality k exists and, if j is the largest value with a nonempty preimage, the preimage cardinality of i is >=k for all i<=j and equal to k for at least one i<=j; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=47A245733
• Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 2.at n=7A245855
• a(n) = p(2*n)-p(2*n-2)-p(n) where p(n) are the partition numbers A000041(n).at n=23A263847
• Vinogradov's number J_{3,2}(n).at n=17A281391
• a(n) = 9*binomial(2*n,n)^2 - 8*binomial(3*n,n).at n=4A357568
• Concatenations x||1||x for numbers x.at n=39A392225
• a(n) is the least number with exactly n prime factors, counted with multiplicity, that is the concatenation of x, 1, and x for some x.at n=5A392239