61992

Appears in sequences

• a(n) = n*(n + 1)*(3*n + 1).at n=27A027903
• Numbers k that divide the number formed by the first k decimal digits of e (A039920(k)).at n=8A065977
• Total area below the lattice paths of length n defined by the rule [(0),(k)->(k-1)(k+1)] (Dyck paths).at n=12A094893
• Expansion of g.f.: x/(1 - 9*x - x^2).at n=6A099371
• Row sums in A100781.at n=35A100784
• a(n) = Fibonacci(6, n).at n=9A124152
• Number of ways to place 3 nonattacking knights on an n X n toroidal board.at n=8A172530
• Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=34A190108
• Numbers n for which there exists k > n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=12A255334
• Number T(n,k) of ordered partitions of an n-set with nondecreasing block sizes and maximal block size equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=60A262071
• Number of ordered partitions of a 2n-set with nondecreasing block sizes and maximal block size equal to n.at n=5A266518
• Number of ordered set partitions of [n] with nondecreasing block sizes and maximal block size equal to five.at n=5A272495
• Numbers k such that phi(x) = 12*k+2 is solvable, where phi is Euler's totient A000010.at n=39A289364
• T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).at n=39A376827
• T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).at n=41A376827