94248

Appears in sequences

• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= n/3.at n=25A047200
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-1)/3.at n=25A048012
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-2)/3.at n=25A048023
• T(2n+1,n), array T as in A054126.at n=6A054132
• Expansion of (1+x^4*C^4)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=9A071757
• Numbers that can be expressed as the difference of the squares of primes in exactly twelve distinct ways.at n=2A092008
• a(n) = number of ways to dispose two pawns on a chessboard of size n X n (two dispositions are equivalent if one can be rotated or reflected to give the other one).at n=35A141582
• Lower triangular array, called S1hat(6), related to partition number array A145356.at n=39A145357
• a(n) = Carmichael(F(n)), where F(n) are the Fibonacci numbers.at n=43A181091
• Numbers with prime factorization p*q*r*s^2*t^3 (where p, q, r, s, t are distinct primes).at n=28A190111
• The number of binary pattern classes in the (2,n)-rectangular grid with 5 '1's and (2n-5) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=15A222715
• Number of length 1+3 0..n arrays with no disjoint pairs in any consecutive four terms having the same sum.at n=16A247727
• a(n) = prime(n) * prime(n^2) - prime(n^3).at n=18A291541
• Expansion of ((1 + 2*x)/(1 - 2*x))^(3/2).at n=13A305031
• Numbers k such that the two perfect powers immediately adjacent to k^2 both have exponents greater than 2.at n=35A340643
• Number of ways to write n as an ordered sum of 6 nonprime numbers.at n=47A341483
• Denominators of the sequence of fractions defined by u(n) = ((5*F(n)*F(n-1)*F(2*n-1)*u(n-1) + F(n-1)*L(n)*u(n-2))/(L(n-1)*F(n))), with u(0) = 0 and u(1) = 1, where F(n) = A000045(n) and L(n) = A000032(n).at n=12A350904
• Numbers k such that k, k+1 and k+2 are all in A362401.at n=12A362405
• a(n) = Sum_{i+j+k=n, i,j,k >= 1} sigma(i) * sigma(j) * sigma(k).at n=19A374951
• a(n) is the smallest positive number with a total of exactly n 2's in the decimal digits of its divisors.at n=45A387396