39138

Appears in sequences

• a(1) = 1, a(n) = Sum_{k=1..n-1} Sum_{d|k} a(d).at n=15A014668
• Triangle read by rows: The n-th row is constructed by forming the partial sums of the previous row, reading from the right and if n is a triangular number repeating the final term.at n=44A099964
• Triangle read by rows: The n-th row is constructed by forming the partial sums of the previous row, reading from the right and if n is a triangular number repeating the final term.at n=45A099964
• First column (also row sums) of triangle in A099964.at n=13A099965
• 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, 1, 1), (0, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=8A150553
• a(n) = 36*n^2 - 2*n.at n=32A158062
• Smallest number for which the greedy algorithm fails to find the sum of n-th powers with at most A002804 terms.at n=7A185187
• Number of 3-connected Schnyder labelings with n inner faces in the quadrangular dissection.at n=13A377920