36652

Appears in sequences

• Sum of odd divisors of n < sqrt(n) = sum of even divisors of n < sqrt(n).at n=10A033832
• Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=44A070980
• Maximal number of 1432 patterns in a permutation of 1,2,...,n.at n=38A100354
• G.f. satisfies: [x^n] A(x)^(n+1) = [x^n] A(x)^n for n>1 with A(0)=A'(0)=1.at n=7A158883
• Number of (n+3) X 7 binary arrays with every 4 X 4 subblock commuting with each horizontal and vertical neighbor 4 X 4 subblock.at n=15A188100
• Rectangular table where the g.f. of row n satisfies: R(n,x) = 1 + x*R(n,x)^n * [d/dx x/R(n,x)] for n>=0, as read by antidiagonals.at n=35A208896
• Number of sequences of 5 throws of an n-sided die (with faces numbered 1, 2, ..., n) in which the sum of the throws first reaches or exceeds n on the 5th throw.at n=13A264750
• Triangle T read by rows: T(n, m), for n >= 2, and m=1, 2, ..., n-1, equals the positive integer solution x of y^2 = x^3 - A(n, m)^2*x with the area A(n, m) = A249869(n, m) of the primitive Pythagorean triangle characterized by (n, m) or 0 if no such triangle exists.at n=80A278711
• a(n) = (2*n-3-(-1)^n)*(22*n^2-21*n+5*n*(-1)^n)/96.at n=43A298992
• Expansion of Sum_{k>=1} k^3 * x^k/(1 - x^k)^3.at n=27A366135