40028

Appears in sequences

• Least m such that A(m) = -10^n, where A(n) = sigma(n) - 2n, the abundance of n.at n=4A075767
• 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, -1, 1), (-1, 0, 0), (0, 0, -1), (0, 1, 1), (1, 0, -1)}.at n=10A148695
• a(n) = Farey(m; I) where m = Fibonacci(n + 1) and I = [1/n, 1].at n=12A176501
• Total sum of parts of multiplicity 6 in all partitions of n.at n=43A222734
• Positive integers j such that prime(i) + prime(j) = i*j for some i <= j.at n=17A272862
• Number of ways to write n as an ordered sum of 10 squarefree numbers.at n=10A341070
• Number of compositions of 2n into n squarefree parts.at n=10A341071
• E.g.f. A(x) satisfies A(x) = 1/(1 - log(1-x*A(x)^2)^2).at n=6A392762