20335

Appears in sequences

• G.f.: (1 + x^3 + x^4 + ... + x^12 + x^15)/Product_{i=1..10} (1 - x^i).at n=32A003403
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 29 ones.at n=6A031797
• Numbers k such that k and k+1 have the same sum of squarefree divisors, or sqf(k) = sqf(k+1), where sqf(k) = A048250(k).at n=11A063964
• Sums of lists produced by a variant of the iteration that produces the Catalan numbers: start with 0 and at each iteration replace each integer k with the list 0,1,...,k-1,k,k+1,k,k-1,...,1,0 and let a(n) be the sum of the resulting (flattened) list after n iterations.at n=7A065096
• Triangular array formed by the little Schröder numbers s(n,k).at n=29A110440
• Total number of different ways to fill m labeled boxes with balls which belong to the specifications provided by all the integer partitions [n] of n. Empty boxes are not allowed. Total number of possible preferential arrangements (or hierarchical orderings) of n elements if the elements may belong to c=1 up to c=n different classes (or specifications).at n=4A137383
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=9A148929
• Those terms of A255571 whose every A080541/A080542-rotation is also a term of A255571.at n=34A258001
• Capped binary boundary codes for holeless strictly non-overlapping polyhexes (all orientations and rotations included).at n=11A258002
• Capped binary boundary codes for fusenes (all orientations and rotations included).at n=11A258012
• Number of equivalence classes of ballot paths of length n for the string ddd.at n=29A274111