30905
domain: N
Appears in sequences
- a(n) = (2*F(3*n) - F(n))/3, where F=A000045 (the Fibonacci sequence).at n=8A049675
- Take an n X n square grid of points in the plane; a(n) = number of non-isomorphic ways to divide the points into two sets using a straight line.at n=29A116696
- 9^n mod 2^n.at n=15A138998
- Number of pairs (lambda,mu) of partitions lambda of n and mu of six with mu <= lambda (by diagram containment).at n=21A303856
- a(n) is the smallest k such that k!'s prime(n)-smooth part is less than its prime(n+1)-rough part.at n=39A360316
- Number of integer partitions of n such that the product of parts is greater than the sum of primes indexed by the parts.at n=39A380411