40635

Appears in sequences

• a(n) = A061680(n!).at n=45A069785
• a(n) = A061680(n!).at n=46A069785
• Smallest term in the Hofstadter sequence A005243 having exactly n representations as sum of consecutive earlier terms.at n=15A118166
• Matrix inverse of triangle A098568, where A098568(n, k) = C( (k+1)*(k+2)/2 + n-k-1, n-k) for n>=k>=0.at n=50A121434
• Odd infinitary abundant numbers.at n=31A127666
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (0, 1, 1), (1, -1, 1), (1, 0, -1)}.at n=8A150563
• E.g.f. satisfies: A'(x) = A(x)^5 * A(-x)^2 with A(0) = 1.at n=6A235360
• Triangle read by rows: coefficients xi(n,k) arising from the study of completely transitive graphs on n nodes.at n=19A259971
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=35A293186
• a(1)=1; for n>1, a(n) = a(n-1) / k if there exists an unused positive integer k (choose the smallest) such that a(n) is a distinct positive integer; otherwise a(n) = a(n-1) * k if the same conditions apply.at n=51A371359
• Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=26A388267