22088

Appears in sequences

• Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=42A054573
• a(n) = Sum_{k=0..n} A000108(k)*A001263(n+1,k+1), where A000108 is the Catalan numbers and A001263 is the Narayana triangle.at n=7A128088
• Number of arrangements of n+1 nonzero numbers x(i) in -6..6 with the sum of floor(x(i)/x(i+1)) equal to zero.at n=3A189495
• T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of floor(x(i)/x(i+1)) equal to zero.at n=39A189498
• Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of floor(x(i)/x(i+1)) equal to zero.at n=5A189501
• Smallest k such that the fundamental unit (x+y*w) or (x+y*w)/2 of the real quadratic field Q(sqrt(k)) obeys gcd(k,y)=n.at n=42A197170
• Numbers k such that if x = sigma(k) + tau(k) - k then k = sigma(x) + tau(x) - x.at n=20A238226
• Sum of the largest two parts in the partitions of 4n into 4 parts with smallest part equal to 1.at n=16A239186
• Number of standard Young tableaux with n cells and 10 as last value in the first row.at n=2A245008
• Triangle read by rows: coefficients of the polynomials A_{2,5}(n,k).at n=23A245172
• Triangle read by rows: coefficients of the polynomials A_{2,5}(n,k).at n=29A245172
• Number T(n,k) of multisets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=68A293808
• Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows.at n=40A293815
• Number of sets of exactly two nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=8A293964
• Number of multisets of exactly two nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A294004
• Lesser members of dihedral amicable pairs: numbers (m, k) such that t(m) = t(k) = m + k, where t(k) = sigma(k) + d(k).at n=6A320457
• Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size three are used and the colors are introduced in increasing order.at n=20A327286