33075
domain: N
Appears in sequences
- Numbers that are sums of two or more consecutive (positive) cubes in more than 1 way.at n=0A062682
- a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).at n=20A082637
- Odd nonunitary abundant numbers.at n=0A094889
- Number of fib010 primes (A095087) in range [2^n,2^(n+1)].at n=20A095067
- Triangle of numbers related to the spectrum of the hydrogen (H) atom.at n=24A119937
- Fourth column (n=4) of triangle A119937.at n=3A119943
- a(0) = 0, a(1) = 5; for n>1, a(n) is determined by the rule that the concatenation of the leading terms of the difference triangle is the same as the concatenation of the digits of the sequence.at n=13A125003
- Increment each prime factor for each term of the least prime sequence A087443.at n=38A131801
- Increment each prime factor for each term of the least prime signature sequence derived from A080577.at n=38A131822
- A certain partition array in Abramowitz-Stegun order (A-St order).at n=34A134144
- Numbers with exactly 3 distinct odd prime divisors {3,5,7}.at n=24A147576
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(i+1) ) and m = 1, read by rows.at n=17A156690
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(i+1) ) and m = 1, read by rows.at n=18A156690
- Numbers of the form p^3*q^2*r^2 where p, q, and r are distinct primes.at n=16A179695
- Least odd integer of each prime signature ordered by prime signatures occurrence.at n=48A233819
- Numbers k such that between k and the next prime there are gpf(k) numbers, where gpf(k) denotes the largest prime factor of k.at n=25A235425
- The sum of the totatives of n is a perfect cube.at n=37A237282
- a(n) = 27*n^2.at n=35A244634
- Numbers n = Product_(p_i^e_i) such that nn = Product_((p_i + 2)^e_i) is divisible by n.at n=39A247213
- Odd numbers of the form (m*k)^2/(m^2-k^2) for distinct integers m and k.at n=25A259288