29546
domain: N
Appears in sequences
- Number of maximal collections of pairwise disjoint subsets {X,Y,Z} of {1, 2, ..., n}, each satisfying X + Y = Z.at n=20A002849
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=35A050035
- Positions where number of periodic partitions increases.at n=45A059994
- Numbers n such that phi(n) = phi(n-1) - phi(n-2).at n=15A066231
- Numbers k such that 4*10^k + 39 is prime.at n=20A294918