21776

Appears in sequences

• Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.at n=29A005427
• Coordination sequence for sigma-CrFe, Position Xc.at n=37A009961
• McKay-Thompson series of class 35A for Monster.at n=45A058640
• a(1) = 1 and a(n) = ceiling((Sum_{k=1..n-1} a(k))/3) for n >= 2.at n=37A072493
• Polar structured meta-anti-diamond numbers, the n-th number from a polar structured n-gonal anti-diamond number sequence.at n=15A100188
• Sum of distances of numbers between successive powers of 2 (beginning with 2^1) to previous numbers with same number of prime factors, repetitions included. See example.at n=10A176883
• G.f. satisfies A(x) = 1 + x/A(x)^2*(1 + 1/A(x)^2).at n=5A364397
• The numbers of people such that, in the variant of the Josephus problem in which three people are skipped and then one is eliminated, the first person is the last to be eliminated.at n=12A385327