79577

Appears in sequences

• a(n) = Sum_{k=0..n} binomial(floor(n-2k/3), k).at n=22A137402
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=9A149635
• Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements.at n=46A239100
• Numbers k for which phi(A267099(k)) is equal to phi(k), but the number of 4m+1 and 4m+3 primes in the prime factorization of k (when counted with multiplicity) is not equal. Here A267099 is fully multiplicative involution swapping the positions of 4m+1 and 4m+3 primes, and phi is Euler totient function.at n=3A354194