21369
domain: N
Appears in sequences
- Partial sums of binary rooted tree numbers.at n=17A014167
- Row sums of triangle A091492.at n=48A091493
- Cascadence of (1+x)^3; a triangle, read by rows of 3n+1 terms, that retains its original form upon convolving each row with [1,3,3,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 3n+1 terms remain in row n for n>=0.at n=52A120919
- Number of 1's in A127962(n).at n=29A127963
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1000-1100-0110-0011 pattern in any orientation.at n=10A147142
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1000-1100-0110-0011 pattern in any orientation.at n=22A147144
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1000-1100-0110-0011 pattern in any orientation.at n=23A147144
- Row sums of triangle defined in A120852.at n=16A160963
- Number of partitions of n containing a clique of size 4.at n=41A183561
- Number of (n+1)X(n+1) -10..10 symmetric matrices with every 2X2 subblock having sum zero and one or three distinct values.at n=7A211815
- Number of tripartite partitions of (n,n,n) into distinct triples.at n=5A219560
- Number A(n,k) of k-partite partitions of {n}^k into distinct k-tuples; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=41A219585
- 28-gonal pyramidal numbers: a(n) = n*(n+1)*(26*n-23)/6.at n=17A256648
- Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once.at n=36A346135
- Numbers k such that gcd(2*k^7+1, 3*k^3+2) > 1.at n=18A369153
- a(n) = sum for all integer partitions of n of the number of distinct multiplicities in each partition.at n=31A373271
- Number of (binary) heaps of length n whose element set equals {1,2,3}.at n=11A376962