25129

Appears in sequences

• a(n) = A060178(n) - A060015(n).at n=7A096596
• a(n) = a(n-1) + a(n-2) + a(n-3) - a(n-4); a(0)=0, a(1)=1, a(2)=1, a(3)=1.at n=21A116201
• Number of strict compositions of n with no three consecutive parts in arithmetic progression.at n=29A325849
• Partial sums of the ziggurat sequence A347186.at n=47A356351
• G.f. satisfies A(x) = 1/(1-x)^3 + x*A(x)^4.at n=5A364624
• For positive integers n, a multiset A of positive integers is called "n-good" if for any number 1 <= i <= n, we can find a submultiset B of A such that the sum of B is equal to i. a(n) is the number of minimal n-good multisets.at n=28A385675