27790
domain: N
Appears in sequences
- Number of rooted trees where each node has at most 4 children.at n=14A036718
- Column 4 of triangle A091602.at n=46A091607
- Number of increasing trees with branches of height 1.at n=7A125307
- Sequence of alternating increasing odd and increasing even numbers such that the sum of any two terms of opposite parity is a prime number.at n=13A162662
- Number of nX4 0..3 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=2A224387
- T(n,k)=Number of nXk 0..3 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=17A224391
- Number of 3 X n 0..3 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=3A224392
- Number of partitions p of n such that min(p) + (number of parts of p) is not a part of p.at n=38A238495
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=18A294545
- a(n) = 1 + Sum_{k=1..n} Sum_{d|k} mu(k/d)*p(d), where p(d) = number of partitions of d (A000041).at n=30A306912
- Number of ways to write n as an ordered sum of 5 prime powers (including 1).at n=45A341134