21110
domain: N
Appears in sequences
- Each permutation in the list A060117 converted to Site Swap notation, with digits reversed. "Zero throws" (fixed elements) indicated with 0's.at n=32A060496
- Factorial expansions of the entries in A085219.at n=38A085221
- Factorial expansions of the entries in A085220.at n=42A085222
- a(n) = (1/5040)*7^n + (1/240)*5^n + (1/72)*4^n + (1/16)*3^n + (11/60)*2^n + 53/144. Partial sum of Stirling numbers of second kind S(n,i), i=1..7 (i.e., a(n) = Sum_{i=1..7} S(n,i)).at n=8A099262
- Triangle of partial sums of Stirling numbers of 2nd kind (A008277): T(n,k) = Sum_{i=1..k} Stirling2(n,i), 1<=k<=n.at n=42A102661
- Take the base-3 representation of n, render that in decimal notation and take the base-3 representation of n again.at n=19A126135
- a(n) = negative integer -n presented in balanced ternary system.at n=41A140268
- 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, 0, 0), (-1, 0, 1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}.at n=10A148208
- Numbers of rank 11 in the poset of lunar numbers.at n=28A191753
- T(n,k)=Number of nXk 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.at n=36A209465
- Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.at n=27A209644
- a(n) = Sum_{m=0..n} 3^v3(m!), where v3(m!) is the exponent of the highest power of 3 dividing n!, expressed in base 3.at n=10A294493
- Number of 3Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=11A302151
- List of binary words of lengths 0, 1, 2, etc., including empty word, each prefixed by a 2.at n=29A319953
- Variation on Golomb's sequence starting with (1,2): a(n)=length of n-th run of both consecutive integers and consecutive digits with same parity.at n=51A327143
- Number of colored integer partitions of n using all colors of a 3-set such that a color pattern for part i has i distinct colors in increasing order.at n=18A327842
- Concatenation of sum n+(n+1) and product n*(n+1) in decimal.at n=10A337148
- Triangle read by rows, T(n, k) = Sum_{j=0..k} Stirling2(n, j) = Sum_{j=0..k} A048993(n, j).at n=52A359107
- Total number of parts coprime to n in the partitions of n into 7 parts.at n=44A363325
- Ternary numbers consisting of a run of 2's, then a run of 1's, then a run of 0's.at n=6A371053