33654
domain: N
Appears in sequences
- Integers x such that for some integer y we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).at n=12A067739
- The number of degree sequences with degree sum 2n representable by a connected graph (with multiple edges allowed).at n=19A147878
- E.g.f. equals the series reversion of x - x*arcsin(x).at n=5A227458
- Squarefree terms of A276655.at n=41A276756
- a(n) = (n-1)!*(Sum_{i=1..n} Sum_{j=1..i} binomial(i,j)*i/j).at n=5A307663
- Number of alternately co-strong integer partitions of n.at n=46A317256
- Number of subsets of {2..n} such that the product of the elements plus 1 is a prime.at n=18A369392