33306

Appears in sequences

• Numbers whose base-8 representation has exactly 6 runs.at n=16A043628
• Smallest oblong (promic) number containing exactly n 3's.at n=2A048536
• Number of 3 X 3 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.at n=13A058389
• Smallest number k such that A065422(k)/A065422(k+1) = k^n, where k>1.at n=6A070970
• Largest x such that 1/x + 1/y + 1/z = 1/n.at n=12A082986
• Squarefree oblong (pronic) numbers having an odd number of prime factors.at n=25A098827
• Alexandrian integers: numbers of the form n = p*q*r such that 1/n = 1/p - 1/q - 1/r for some integers p,q,r.at n=27A147811
• a(n) = n*(n+1)*(n*(n+1)+1).at n=14A169938
• a(n) = n^4 + 6n^3 + 14n^2 + 15n + 6.at n=12A176780
• a(n) = 25*n^2 + 25*n + 6.at n=36A177059
• Integers that do not have a partition into a sum of an odd square and two (not necessarily distinct) triangular numbers.at n=47A191764
• a(n) = Sum_{k=1..n} binomial(n,k) * sigma(n,k) * 3^(n-k).at n=4A206766
• z-value of the lexicographically first solution (x,y,z) of 4/n = 1/x + 1/y + 1/z with 0 < x < y < z all integers, or 0 if there is no such solution. Corresponding x and y values are in A257839 and A257840.at n=51A257841
• Numbers that are both interprime and oblong.at n=44A263676
• Irregular table read by rows: T(0,0) = 2 and T(n,2k) = T(n-1,k)+1, T(n,2k+1) = T(n-1,k)*(T(n-1,k)+1) for 0 <= k < 2^(n-1).at n=42A273317
• Alternate version of A273317 with rows sorted in ascending order.at n=55A273338
• Oblong numbers n such that n - 1 and n + 1 are both semiprime.at n=32A276565
• Numbers k satisfying gcd(k^2, sigma(k^2)) > sigma(k), where sigma is the sum-of-divisors function.at n=20A322154
• Oblong composite numbers m such that beta(m) = tau(m)/2 - 1 where beta(m) is the number of Brazilian representations of m and tau(m) is the number of divisors of m.at n=14A326384
• Coefficients in asymptotic expansion of sequence A101880.at n=9A331826