26970

Appears in sequences

• a(n) = (4*n+1)*(4*n+2)*(4*n+3).at n=7A001505
• a(0) = 1, a(1) = 0, a(2) = -1; for n >= 3, a(n) = - a(n-2) + Sum_{ primes p with 3 <= p <= n} a(n-p).at n=63A002121
• a(n) = n*(n+5)*(n+6)*(n+7)/24.at n=24A005587
• a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=31A007531
• a(n) = floor( n*(n-1)*(n-2)*(n-3)/28 ).at n=31A011938
• a(n) = floor( n*(n-1)*(n-2)*(n-3)/32 ).at n=32A011942
• a(n) = lcm(n,n+1,n+2).at n=28A033931
• Numbers whose base-4 representation contains exactly four 1's and four 2's.at n=25A045109
• a(n) = (2n+1)*(2n+2)*(2n+3).at n=14A069072
• a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947).at n=28A078637
• a(n) = rad(n*(n+1)*(n+2)*(n+3)).at n=28A078638
• Squarefree numbers which are products of three consecutive numbers. I.e., squarefree numbers of the form k^3 - k.at n=4A084694
• Let A denote the sequence; A is equal to the union of the self-convolutions A^2 and A^3, with terms in ascending order by size.at n=33A090845
• a(n) = (3*n-1) * 3*n * (3*n+1).at n=9A097321
• Numerator of binomial(6*n-2,2*n)/(2*binomial(4*n-1,2*n)).at n=6A109074
• Numbers k such that k and 5*k, taken together, are pandigital.at n=20A115925
• a(n) = n*(n-1)*(n-2)*(n-3)*...*(n-k) such that (n-k) is the largest prime smaller than n.at n=30A117481
• p*(p+1)*(p+2) where (p,p+2) are twin primes.at n=4A126248
• Product of the n-th run of squarefree numbers.at n=8A136742
• Squarefree positive integers of the form u*v*(u^2-v^2) for some integer u,v.at n=22A147779