105336

Appears in sequences

• a(n) = Sum_{d|4} phi(d)*n^(4/d).at n=18A054603
• Integers k such that k*28*c + 1 is prime for c = 1, 2, 4, 7 and 14.at n=30A067199
• Maximal number of 165432 patterns in a permutation of 1,2,...,n.at n=25A100356
• Triangle read by rows: T(n,k) is the number of nonroot nodes of outdegree k (0<=k<=n-1) in all non-crossing trees with n edges.at n=39A100400
• Numbers that have exactly eight prime factors counted with multiplicity (A046310) whose digit reversal is different and also has 8 prime factors (with multiplicity).at n=17A109028
• Number of permutations p() of 1..n+2 with centered difference p(i+1)-p(i-1) < 0 exactly once.at n=9A180879
• a(n) = (n-3)*(n-2)*(n-1)*n*(n+1)/30.at n=21A210569
• Number T(n,k) of permutations of [n] with k ordered cycles such that equal-sized cycles are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=51A285849
• Number of permutations of [n] with six ordered cycles such that equal-sized cycles are ordered with increasing least elements.at n=3A285857
• Numbers k satisfying gcd(k^2, sigma(k^2)) > sigma(k), where sigma is the sum-of-divisors function.at n=32A322154
• a(n) is the smallest positive integer y such that there exists an integer x such that binomial(x + i*y, n) is a Gaussian integer.at n=19A387569
• a(n) is the smallest positive integer y such that there exists an integer x such that binomial(x + i*y, n) is a Gaussian integer.at n=21A387569