35952

Appears in sequences

• Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, down, up, up.at n=8A177527
• Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=6A207841
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=51A207845
• Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=3A207850
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=32A338474
• a(n) = Sum_{d|n} d^(tau(d) - 1).at n=32A348349