20112
domain: N
Appears in sequences
- E.g.f.: tan(cos(x)*arcsin(x))=x-20/5!*x^5-56/7!*x^7+20112/9!*x^9...at n=4A012483
- Expansion of 1/(1-x^3-x^4-x^5).at n=40A017818
- Another lazy binary representation of n: similar to A089591 except that the single carry is performed before the increment instead of after.at n=40A089600
- Structured heptagonal anti-diamond numbers (vertex structure 7).at n=17A100186
- A higher order recursion triangle sequence: m=4;l=4;e(n,k,m)=(l*k + m - 1)e(n - 1, k, m) + (m*n - l*k + 1 - m)e(n - 1, k - 1, m).at n=18A156280
- Transform of A056594 by the T_{0,0} transformation (see link).at n=13A159350
- a(0) = 1, a(1) = 8, a(n) = 56*a(n-2) - a(n-1).at n=5A165506
- Number of n X n 0..3 arrays with row sums 7 and column sums 7.at n=3A172724
- Number of n X n 0..3 arrays with row sums 5 and column sums 5.at n=3A172736
- Numbers n such that d(1)^1 + d(2)^2 + ... + d(p)^p and d(1)^p + d(2)^p-1 +... + d(p)^1 are squares, where d(i), i=1..p, are the digits of n.at n=40A178360
- Number of 5-step self-avoiding walks on an n X n square summed over all starting positions.at n=15A188150
- Numbers 3*n + 2 written in base 3.at n=58A190642
- The number of all possible covers of L-length line segment by 3-length line segments with allowed gaps < 3.at n=37A228362
- Number of length n+2 0..6 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..6 introduced in 0..6 order.at n=11A243725
- Number of equivalence classes of ballot paths of length n for the string uu.at n=18A274110
- Numbers n such that sum of decimal digits of n equals number of prime divisors of n counted with multiplicity and sum of distinct decimal digits of n equals number of distinct primes dividing n.at n=11A280911
- Number of ways to write n as an ordered sum of 6 prime power palindromes (A084092).at n=27A282845
- Number of subsets of {2..n} containing all of their integer quotients > 1.at n=19A326078
- Number of subsets of {1..n} containing all of their integer quotients > 1.at n=18A326079
- Number of ways to write n as an ordered sum of 6 squarefree numbers.at n=23A341066