151704

Appears in sequences

• Denominator of B_{2n}/(-4n), where B_m are the Bernoulli numbers.at n=21A006863
• Denominator of B(4n+2)/(8n+4) where B(m) are the Bernoulli numbers.at n=9A043304
• Triangle T(n,k) read by rows: number of labeled trees with n nodes and k leaves, n >= 2, 2 <= k <= n.at n=32A055314
• Number of labeled trees with n nodes and 6 leaves.at n=2A055318
• Largest number m such that a^n == 1 (mod m) whenever a is coprime to m.at n=41A079612
• Sum of the first n weird numbers.at n=16A125114
• Largest number k such that the reduced totient function psi(k) = A002174(n).at n=17A143407
• Number of nX4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.at n=10A207119
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=5A251873
• Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=4A251874
• Triangle read by rows: T(n,k) = logarithmic polynomial G_k^(n)(x) evaluated at x=-1.at n=38A260323
• a(n) is the largest number m satisfying lambda(m)=n, or zero if there is no solution, where lambda(m) is Carmichael's lambda function A002322(m).at n=41A270562
• Triangle read by rows, T(n, k) = RisingFactorial(n - k, k) * Stirling2(n - k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.at n=33A362788
• Triangle of numbers read by rows, T(n, k) = (n*(n-1)*(n-2))*Stirling2(k, 3), for n >= 1 and 1 <= k <= n.at n=42A362791