133488

Appears in sequences

• Numbers with 50 divisors.at n=31A175756
• Triangle read by rows: T(n,k) is the number of permutations of [n] with k circular successions (0<=k<=n-1). A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.at n=37A180188
• Number of permutations of [n] having exactly 1 circular succession. A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.at n=8A180189
• a(0)=0, a(n) = (a(n-1) XOR n) * (n+1).at n=8A182437
• Numbers with prime factorization pq^4r^4.at n=30A190012
• Number of locally disjoint rooted trees with n nodes, meaning no branch overlaps any other (unequal) branch of the same root.at n=15A316473