46305

Appears in sequences

• Where A098018(k)=n.at n=12A098869
• Numbers with exactly 3 distinct odd prime divisors {3,5,7}.at n=28A147576
• a(n) = (2*n^3 + 5*n^2 + 21*n)/2.at n=34A162266
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=21A212863
• Number of n X 4 0..5 arrays with no entry increasing mod 6 by 5 rightwards or downwards, starting with upper left zero.at n=1A222277
• T(n,k) = number of n X k 0..5 arrays with no entry increasing mod 6 by 5 rightwards or downwards, starting with upper left zero.at n=11A222281
• T(n,k) = number of n X k 0..5 arrays with no entry increasing mod 6 by 5 rightwards or downwards, starting with upper left zero.at n=13A222281
• Sum of all the middle parts in the partitions of 3n into 3 parts.at n=41A236364
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of distinct parts of p.at n=46A241818
• a(n) = 5*n^3.at n=21A244725
• Positive integers whose square is the sum of 50 consecutive squares.at n=18A257781
• Partition array in Abramowitz-Stegun order for the number of ways of putting n stones into a rectangular m X n grid of squares such that each of the m rows contains at least one stone.at n=36A258152
• a(n) = Fibonacci(3*n) - (2 + (-1)^n)*Fibonacci(n).at n=7A273623
• Number of Dyck paths of semilength n and height exactly 9.at n=5A289422
• a(n) is the largest odd positive integer that is abundant and has the same prime signature as A279537(n) or 0 if no such integer exists.at n=37A343330
• Odd numbers k that can be factored to such a pair of coprime factors x and y that A347381(k) < min(A347381(x), A347381(y)).at n=23A347390
• Numbers k such that sigma(k) is either their sibling in Doudna tree (A005940), or one of the sibling's descendants.at n=10A347391
• Odd numbers k such that A162296(k) > 2*k.at n=28A357607
• After the initial 1, numbers k such that A347381 obtains its minimum value at k, of all the divisors d of k larger than one, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940).at n=25A374218
• Numbers k such that the odd parts of sigma(k) and A064989(k) are equal, where A064989 shifts the prime factorization one step towards lower primes, and sigma is the sum of divisors function.at n=10A374463