152064

Appears in sequences

• Expansion of sin(sinh(x))*x.at n=6A009493
• Unitary-sigma sigma multiply perfect numbers: numbers k such that A061765(k) = m*k for some integer m.at n=44A045795
• Binomial transform of heptagonal numbers A000566.at n=11A084899
• When this sequence is interleaved with its first differences and the resulting sequence is divided into blocks of 10 digits, each block contains 10 distinct digits. Each term is chosen to be the smallest that satisfies this property.at n=25A101246
• Number of divisors of n!! (double factorial = A006882(n)).at n=39A114338
• Numbers k such that tau(phi(k)) = rad(k).at n=23A173618
• Number of 2-step self-avoiding walks on an n X n X n X n 4-cube summed over all starting positions.at n=11A188785
• Numbers m for which Sum_{i=1..k} (1+1/p_i) + Product_{i=1..k} (1+1/p_i) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=13A199767
• Number of partitions of n having (sum of odd parts) = (sum of even parts).at n=68A239261
• Catalan number analogs for totienomial coefficients (A238453).at n=12A245798
• Number of partitions of 4n with equal sums of odd and even parts.at n=17A249914
• a(n) = 3*n*(n^2 + 3*n + 4).at n=36A280304
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of continued fraction 1/(1 - 2^k*x/(1 - 4^k*x/(1 - 6^k*x/(1 - 8^k*x/(1 - 10^k*x/(1 - ...)))))).at n=24A291260
• a(n) = [x^n] 1/(1 - 2^n*x/(1 - 4^n*x/(1 - 6^n*x/(1 - 8^n*x/(1 - 10^n*x/(1 - ...)))))), a continued fraction.at n=3A291331
• Number of interior points that are the intersections of exactly two chords in the configuration A006561(n).at n=47A292104
• a(n) = n*Product_{k=1..n} floor(k^((n-k)/(n-k+1))).at n=10A333690
• The number of interior points that are intersections of exactly two chords for a 2n-gon where all its vertices are joined by lines (cf. A006561).at n=23A352144
• Numbers m such that A034448(A188999(m)) = k*m for some k, where A034448 and A188999 are respectively the unitary and the bi-unitary sigma function.at n=33A369204
• Triangle T(n,k) read by rows (n >= 0, k >= 0) with g.f. 1/(1 - f(0)*x - x*y/(1 - f(1)*x - x*y/(1 - f(2)*x - x*y/(1 - f(3)*x - x*y/(1 - f(4)*x - x*y/(1 - ...)))))) where f(n) = n + 1 for n >= 0.at n=41A383019