1113840

Appears in sequences

• Maximal period of an n-stage shift register.at n=26A005417
• Write cosec x = 1/x + Sum e_n x^(2n-1)/(2n-1)!; sequence gives denominators of e_n.at n=23A036283
• Bessel polynomial {y_n}'''(0).at n=14A065949
• Largest element of n-th row of A080738.at n=26A080742
• Smallest numbers having exactly n divisors d>1 such that also d+1 is a divisor.at n=24A088726
• Smallest number not yet used that is either a divisor or multiple of both n and a(n-1).at n=17A119862
• Triangle T(n,k), 1<=k<=n, read by rows given by T(n,k) = A003266(n)/A000045(k).at n=38A121284
• Denominator of the polynomial A_l(x) = sum_{d=1..l-1} x^(l-d)/d for index l=2n+1 evaluated at x=11.at n=8A145630
• a(n) = n * A002445(n).at n=24A228838
• Integers n that belong to more Pythagorean triples than preceding integers.at n=42A269928
• Numbers x such that there exist a pair y, n with x < y, x != n and y != n that makes {x,y,n,n} an amicable multiset.at n=2A273970
• Highly composite numbers of class 6 (see comment in A275239).at n=34A275244
• Least k such that the number of pairs of consecutive divisors of k equals n.at n=25A287142
• Irregular triangle T giving the coefficients of x^n = x^{2*e2 + 3*e3} of (1 + x^2 + x^3)^n, with the pair of nonnegative numbers [e2, e3] listed in row n of A321201, for n >= 2.at n=33A321203
• Ordered set partitions of the set {1, 2, ..., 3*n} with all block sizes divisible by 3, irregular triangle T(n, k) for n >= 0 and 0 <= k < A000041(n), read by rows.at n=23A327023
• Numbers that are a smallest number with k pairs of successive divisors, for some k.at n=27A328450
• Numbers k such that A122111(k) [conjugated prime factorization of k] is one of Ore's Harmonic numbers (in A001599).at n=32A336317
• a(n) = denominator(4^(n + 1)*zeta(-n, 1/4)).at n=47A344918
• Integers whose number of normal undulating divisors sets a new record.at n=35A355304
• Triangle read by rows T(n, k) = binomial(2*n, k) * binomial(3*n - k, 2*n).at n=31A357613