138414
domain: N
Appears in sequences
- a(n) is the number of ways the set {1^4, 2^4, ..., n^4} can be partitioned into two sets of equal sums.at n=38A111253
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k ascents of length 4 (0<=k<=floor(n/4)). Also number of ordered trees with n edges which have k vertices of outdegree 4.at n=24A114508
- Number of Dyck paths of semilength n having no ascents of length 4.at n=12A114509
- Number of 5-cycles in the n-Mycielski graph.at n=6A301769