37839

Appears in sequences

• Triangle read by rows, T(n,k) for 0<=k<=n, generalizing A098742.at n=50A216916
• Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 2, m + 3, m + 4, where m == 2 (mod 4).at n=23A243581
• Sum of the second largest parts in the partitions of n into 8 parts.at n=42A308997
• Let PG(n) be the graph with one node for each free n-celled polyhex and edges between nodes corresponding to polyhexes that can be obtained from each other by moving one cell, where the intermediate polyform (the set of cells remaining when the cell to be moved is detached) is required to be a connected polyhex. a(n) is the number of edges in PG(n).at n=7A389970