50963

Appears in sequences

• Number of classes of compositions of n equivalent under reflection or cycling.at n=20A091696
• a(1)=a(2)=1; thereafter, a(n+1) = a(n) + a(n-1) + 1 if n is a multiple of 5, otherwise a(n+1) = a(n) + a(n-1).at n=23A124502
• Terms in A015922 not divisible by 3.at n=10A130133
• Power ceiling sequence of sqrt(5).at n=12A218983
• Numbers n such that 3^(n - 3) is congruent to 1 modulo n.at n=3A242865
• 3-Knödel numbers (A033553) that are not divisible by 3.at n=0A277344
• Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 3 (mod p-1), where s_p(m) is the sum of the base p digits of m.at n=10A324405