28505

Appears in sequences

• Number of partitions of n with equal number of parts congruent to each of 3 and 4 (mod 5).at n=48A035561
• Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=31A061364
• a(n) = a(n-1)*a(n-3)+1 with a(0)=a(1)=a(2)=0.at n=13A121253
• 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, 1, -1), (0, 0, 1), (1, -1, 0), (1, 0, 1)}.at n=9A149885
• 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, 1), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 0, 1)}.at n=9A149886
• Expansion of Product_{k>=2} (1 + x^Fibonacci(k))^Fibonacci(k).at n=35A291650