28874

Appears in sequences

• a(n) is the solution to the postage stamp problem with 6 denominations and n stamps.at n=17A001211
• Number of permutations of floor(i*7/6), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=8A147904
• Number of permutations of floor(i*7/6), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=8A147913
• Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n.at n=28A208972
• Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 6.at n=47A245146
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - 3*b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=20A295360
• a(n) is the least number k such that the k-th difference between consecutive practical numbers, A179651(k), equals 2*n, or -1 if no such k exists.at n=26A364706