480480

Appears in sequences

• First differences of sequence of primorials.at n=6A061720
• a(1)=1; for n > 0, a(n+1) = rad(a(n))*n where rad=A007947.at n=16A066332
• Terms of A025487 which are a multiple of their indices.at n=31A077562
• Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.at n=2A083863
• Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.at n=10A083863
• a(n) = p(n)/p(n-1), where p(n) = ( floor(n*log(n)) / Product_{j=2..pi(floor(n*log(n)))} prime(j) )!.at n=23A088301
• Numbers that can be expressed as the difference of the squares of primes in exactly thirteen distinct ways.at n=2A092009
• a(n) is found from a(n-1) by dividing by D-1 and multiplying by D, where D is the smallest number that is not a divisor of a(n-1).at n=38A133582
• Lenstra numbers with 6 divisors in a single residue class.at n=3A146544
• Numbers with exactly 6 distinct prime divisors {2,3,5,7,11,13}.at n=15A147573
• Where record values occur in A056595.at n=38A194096
• 5-quantum transitions in systems of N>=5 spin 1/2 particles, in columns by combination indices.at n=28A213347
• Largely composite numbers that are not highly composite.at n=58A244353
• a(n) gives the denominators for A250031(n) as well as for A250032(n).at n=15A250033
• a(n) = the smallest number k such that floor(Sum_{d|k} 1/tau(d)) = n.at n=17A265393
• Numbers k such that floor(Sum_{d|k} 1 / sigma(d)) = 3.at n=12A265713
• Positions of records in A266342.at n=7A266343
• Integers n that belong to more Pythagorean triples than preceding integers.at n=40A269928
• Highly composite numbers of class 6 (see comment in A275239).at n=31A275244
• a(n) = Sum_{k=0..n} binomial(n+k,n)*binomial(2*n-3,n-k-1) for n>1, a(n) = n for n<=1.at n=8A278689