20085
domain: N
Appears in sequences
- Decimal part of a(n)^(1/5) starts with a 'nine digits' anagram.at n=7A034280
- Number of partitions of n in which each odd part has odd multiplicity.at n=42A131942
- 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, -1, 1), (-1, 1, 1), (0, 1, -1), (1, 0, 0)}.at n=10A148256
- E.g.f.: A(x) = Sum_{n>=0} (-log(1 - sin(n*x)))^n/n!.at n=5A223898
- The Wiener index of the graph obtained by applying Mycielski's construction to the crown graph G(n) (n>=3).at n=36A228598
- Number of partitions of n such that (least part) >= (multiplicity of least part).at n=45A240177
- Number of length n+5 0..4 arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=1A250332
- T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=11A250336
- Number of length 2+5 0..n arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=3A250338
- Numbers k such that (8*10^k + 49)/3 is prime.at n=30A270890
- Number T(n,k) of set partitions of [n] such that k is the largest element of the last block; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=52A271466
- Number of set partitions of [n] such that 8 is the largest element of the last block.at n=2A271747
- Number of set partitions of [n+2] such that n is the largest element of the last block.at n=7A271753
- Number of ways to write n as an ordered sum of nine powers of 2.at n=24A342252
- Products k of 4 distinct primes (or tetraprimes) such that k has no squarefree neighbors.at n=29A364141