222768

Appears in sequences

• 4-infinitary perfect numbers: numbers k such that 4-infinitary-sigma(k) = 2*k.at n=3A074849
• UO-sigma multiperfect numbers: n such that A069184(n)/n is an integer.at n=8A092356
• Triangle read by rows: T(n,k) = binomial(3k,k)*binomial(n+k,3k)/(2k+1) (0 <= k <= floor(n/2)).at n=54A108759
• A145312(n)/1440.at n=15A145346
• a(n) is the smallest n-perfect number of the form 2^(n+1)*L, where L is an odd number with exponents <= n in its prime power factorization, and a(n)=0 if no such n-perfect number exists.at n=2A178785
• Smallest k such that the partial sums of the divisors of k (taken in increasing order) contain exactly n primes.at n=26A187822
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=26A208065
• Triangle read by rows: T(n, k) = binomial(2*n, n + k) * binomial(n + 1, k)/(n + 1).at n=48A286784
• Numbers m having greatest prime power divisor d such that d is smaller than the difference between m and the largest prime smaller than m and d is smaller than the difference between m and twice the largest prime smaller than m/2.at n=37A290290
• Smallest integer such that the sum of its n smallest divisors is a Fibonacci number, or 0 if no such integer exists.at n=36A292467
• a(n) is the least number with exactly n divisors of the form 5*k+1.at n=30A364586
• a(n) is the least number with exactly n divisors of the form 5*k+2.at n=29A364598
• a(n) is the least number with exactly n divisors of the form 5*k+3.at n=31A364599
• a(n) is the least number with exactly n divisors of the form 5*k+4.at n=29A364600