23820
domain: N
Appears in sequences
- Theta series of A*_14 lattice.at n=28A023926
- "BFK" (reversible, size, unlabeled) transform of 1,2,3,4...at n=16A032045
- Number of primitive (aperiodic) step shifted (decimated) sequences using a maximum of six different symbols.at n=5A056385
- Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.at n=12A064046
- Triangle read by rows: T(n, k) = (2^(n-k) + 2^k)*A008292(n+1, k+1).at n=23A154693
- Triangle read by rows: T(n, k) = (2^(n-k) + 2^k)*A008292(n+1, k+1).at n=25A154693
- a(n) = n^2 + a(n-1), with a(1)=0.at n=40A168559
- Expansion of 1/(1-2x/(1-2x/(1-x/(1-2x/(1-2x/(1-x/(1-2x/(1-... (continued fraction).at n=7A186338
- Number of equivalence classes of binary words of length n for the set of subwords {010, 101, 10110}.at n=17A317779
- Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).at n=22A361456
- Number T(n,k) of partitions of n with largest part k where each block of part i with multiplicity j is marked with a word of length i*j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=59A364285