34797

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3 and a(3) = 2.at n=16A049922
• The bisection A053445(2n+1).at n=31A161921
• Number of 6-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n.at n=14A208973
• Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 10 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=3*floor(n/3), read by rows.at n=50A238592
• Number of compositions (ordered partitions) of n into distinct parts where no part is a multiple of 5.at n=34A332311