22995

Appears in sequences

• Odd primitive abundant numbers.at n=31A006038
• T(2n+4,n), where T is the array in A055830.at n=5A055838
• a(n) = p(0) + p(1) + ... + p(n) - n - 1, where p = partition numbers, A000041.at n=29A058682
• Nearest integer to log(n!)^(1 + log(log(1 + n))).at n=32A062476
• Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.at n=29A075460
• Triangle read by rows, defined by T(n,k) = C(n,k)*S2(n,k), 0 <= k <= n, where C(n,k) are the binomial coefficients and S2(n,k) are the Stirling numbers of the second kind.at n=57A090683
• Triangle T(n, k, m) = (m+1)^n*binomial(n,k)*f(n,m)*f(k,n-m)/n!, with T(n, 0, m) = 1, where f(n, k) = Product_{j=1..n} ( (1 - (k+1)^J)/(-k)^j ), f(n, 0) = n!, and m = 0, read by rows.at n=31A157284
• Numbers n such that n^6 + 272 is prime.at n=31A161998
• Numbers n such that (n^6 + 1091)/4 is prime.at n=14A181112
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=32A188439
• Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=5A208105
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=50A208108
• Number of 6 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=4A208111
• Number of (n+1)X(n+1) -8..8 symmetric matrices with every 2X2 subblock having sum zero and one, two or three distinct values.at n=6A211470
• Odd numbers in A192274.at n=38A243104
• Irregular triangle read by row: T(n,k), n>=1, k>=1, in which column k lists the numbers of A000716 multiplied by A000330(k), and the first element of column k is in row A000217(k).at n=37A252117
• a(n) = number of permutations of (1,2,...,n) producible by an ordered quadruple of distinct transpositions.at n=5A253207
• Irregular triangle read by rows where row n lists all odd primitive abundant numbers with n prime factors, counted with multiplicity.at n=30A287646
• Numbers n for which A325565(n) < A325568(n).at n=47A325569
• Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2*k.at n=32A333950