35652

Appears in sequences

• Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k ascents (0<=k<=floor(n/3)).at n=54A114712
• Numbers k such that lambda(k) = lambda(k-1) + lambda(k-2), where lambda(k) is Carmichael lambda function (A002322).at n=15A291175
• Square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where A(n,k) is Sum_{d|n} d^(1 + k*n/d).at n=50A294579
• Take apart the sides of each of the integer-sided scalene triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total volume of all rectangular prisms enclosed in this way.at n=36A308234
• Number of pairs of integer partitions of n where every part of the first is less than every part of the second.at n=27A322440
• Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=46A323750
• Numbers that are the sum of seven fourth powers in eight or more ways.at n=19A345574
• Numbers that are the sum of seven fourth powers in exactly eight ways.at n=13A345830