29244

Appears in sequences

• a(n) = A188491(n+1) - A188494(n) - A002526(n).at n=11A002528
• a(n) = a(n-1) + a(n-5); a(0) = ... = a(4) = 1.at n=39A003520
• Expansion of 1/(1 -x^5 -x^6 -x^7 - ...).at n=44A017899
• a(1)=1; a(n)=sum(u=1,n-1,sum(v=1,u,sum(w=1,v,sum(x=1, w,sum(y=1,x,a(y)))))).at n=8A079675
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}.at n=41A079955
• Sum C(n-4k,k-1), k=0..floor(n/5).at n=43A099562
• Number of n-step one-sided prudent walks, avoiding exactly two consecutive west steps (can have three or more west steps).at n=12A190525
• a(n) = ceiling((n+1/n)^4).at n=12A197903
• Triangle with entry a(n,m) giving the number of bracelets of n beads (dihedral D_n symmetry) with n colors available for each bead, but only m distinct fixed colors, say c[1],...,c[m], are present, with m from {1,...,n} and n>=1.at n=50A213940
• Number of partitions of n with difference 6 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=42A242697
• a(n) is the number of representative six-color bracelets (necklaces with turning over allowed; D_6 symmetry) with n beads, for n >= 6.at n=4A292223
• Number of edges formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square.at n=9A358409