150300
domain: N
Appears in sequences
- Number of ways to partition the multiset consisting of n copies each of 1, 2, and 3 into n sets of size 3.at n=26A254233
- p-INVERT of (1,0,0,1,0,0,0,0,0,0,...), where p(S) = 1 - S^2.at n=40A292402
- a(n) = (n*sigma_9(n) - tau(n))/7 = (A282254(n) - A000594(n))/7, where tau is Ramanujan's tau, sigma_9(n) = Sum_{d divides n} d^9.at n=3A337032