80025
domain: N
Appears in sequences
- Number of ways to represent n using the binary operator a * b = 2^a + b.at n=19A000630
- a(1)=1, a(n) = a(n-1) + n^5 if n odd, a(n) = a(n-1) + n^3 if n is even.at n=8A135099
- Numbers n such that phi(n) = phi(n+7), with Euler's totient function phi = A000010.at n=35A179189
- Triangle T(n,k) read by rows: number of chord diagrams with k isolated bracelets and a total of n chords.at n=37A371305