288288

Appears in sequences

• a(n) = 7*(n+1)*binomial(n+3,7).at n=7A027792
• a(n) = 12*(n+1)*binomial(n+3,9).at n=5A027794
• a(n) = 3*(n+1)*binomial(n+5,6).at n=10A027811
• UO-sigma multiperfect numbers: n such that A069184(n)/n is an integer.at n=9A092356
• Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.at n=50A093346
• 5-infinitary perfect numbers: numbers k such that 5-infinitary-sigma(k) = 2*k.at n=4A097464
• Non-palindromes in A110751; that is, non-palindromic numbers n such that n and R(n) have the same prime divisors, where R(n) = digit reversal of n.at n=31A110819
• Lenstra numbers with 6 divisors in a single residue class.at n=1A146544
• 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=3A178785
• Smallest k such that the partial sums of the divisors of k (in decreasing order) generate n primes.at n=16A187825
• Number of one-sided prudent walks from (0,0) to (n,n), with 3+n east steps, 3 west steps and n north steps.at n=6A189769
• Number of one-sided prudent walks from (0,0) to (n,n), with floor(n/2)+n east steps, floor(n/2) west steps and n north steps.at n=7A190425
• Numbers other than prime powers divisible by the sum of the squares of their prime divisors.at n=30A190882
• Least Niven number for all bases from 1 to n but not for base n+1.at n=24A225427
• Numbers other than prime powers divisible by the sum and the sum of squares of their prime divisors.at n=6A268417
• a(n) is the smallest number that has exactly n divisors that are cyclops numbers (A134808).at n=14A357033
• a(n) is the least number with exactly n divisors of the form 5*k+1.at n=37A364586
• a(n) is the least number with exactly n divisors of the form 5*k+2.at n=34A364598
• a(n) is the least number with exactly n divisors of the form 5*k+3.at n=38A364599
• a(n) is the least number with exactly n divisors of the form 5*k+4.at n=34A364600