30009
domain: N
Appears in sequences
- a(n) = ceiling(n*phi^15), where phi is the golden ratio, A001622.at n=22A004970
- Number of partitions of n into at least two parts such that the product of largest and smallest part does not exceed n.at n=39A116901
- a(n) = 62*n^2 + 1.at n=22A158676
- Total sum of the odd-indexed parts of all partitions of n.at n=24A207381
- The width of the lattice of Dyck paths of length 2n ordered by the relation that one Dyck path lies above another one.at n=13A274291
- Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero.at n=14A301658
- a(n) = (3*n^5 + 4*n^3 - n)/6.at n=8A372751