37037

Appears in sequences

• Expansion of 1/((1-2*x)*(1-6*x)*(1-11*x)).at n=4A016308
• a(n) = floor(10^6/n).at n=26A033426
• Terms of A050530 with four prime divisors.at n=23A053340
• Divisors of 111111.at n=30A109492
• a(n) = (n+1)(n+2)(n+3)(9n^2 + 26n + 20)/120.at n=12A110159
• a(n)*n = A112893(n).at n=5A112894
• Minimum number k for which the digital sum of k*n is 2*n.at n=27A147822
• a(n) = 1001*n.at n=36A153814
• a(n) = 100*n^2 - 151*n + 57.at n=19A157626
• Multiples of 5291.at n=7A178027
• Floor((11n+1/n)^n).at n=2A197600
• Round((11*n+1/n)^n).at n=2A197984
• Number of tilings of a 9 X n rectangle using integer-sided square tiles of area > 1.at n=22A226373
• Table (read by rows) of the natural numbers (in ascending order) whose reciprocals have only periodic decimals of length k.at n=71A226477
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 331", based on the 5-celled von Neumann neighborhood.at n=37A271279
• Expansion of Sum_{i>=1} mu(i)^2*i*x^i/(1 - x^i) / Product_{j>=1} (1 - x^j), where mu() is the Moebius function (A008683).at n=24A281904
• a(n) = (3*n + 4)*Pochhammer(n, 4) / 4!.at n=11A293475
• a(n) is the smallest number such that there are exactly n numbers k (including a(n) itself) such that U(k) is isomorphic to U(a(n)) (or 0 if no such number exists). Here U(k) is the multiplicative group of integers modulo k.at n=42A303712
• Numbers of the form ab such that phi(ab) = a*b - 1 where ab is the concatenation of a and b.at n=4A336192
• Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1).at n=24A349941