33929

Appears in sequences

• n+phi(n)+phi(phi(n)) is a cube.at n=24A116042
• Number of partitions of n such that the largest part is a multiple of the smallest part.at n=39A117086
• Number of (n+2)X(n+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=7A252953
• a(n) = F(n)*F(n+1) + F(n+2), where F = A000045 (Fibonacci numbers).at n=12A305412
• Number of compositions of n such that every restriction to a circular subinterval has a different sum.at n=41A325679
• T(n,k) is the number permutations p of [n] that are j-dist-increasing for exactly k distinct values j in [n], where p is j-dist-increasing if j>=0 and p(i)<p(i+j) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=61A370506