35787

Appears in sequences

• a(n) = Sum_{k=0..n} 3^k*F(k) where F(k) is the k-th Fibonacci number.at n=7A082987
• Numbers n with k divisors such that n-1 and n+1 in binary representation have same number k of 0's as 1's.at n=40A191369
• Numbers k such that k^11 + 11*k + 11^k is prime.at n=17A220787
• Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).at n=43A240308
• Table T(n,k), n>=1, k>=1, read by antidiagonals: T(n,k) = number of equivalence classes of ways of placing five 1 X 1 tiles in an n X k rectangle under all symmetry operations of the rectangle.at n=49A248017
• Table T(n,k), n>=1, k>=1, read by antidiagonals: T(n,k) = number of equivalence classes of ways of placing five 1 X 1 tiles in an n X k rectangle under all symmetry operations of the rectangle.at n=50A248017
• Expansion of Product_{k>=0} 1/(1 - x^(3*k+1))^2.at n=46A261616
• Positions of 3's in A264977; positions of 6's in A277330.at n=49A277713
• Number of integer partitions of n with at least two adjacent parts of quotient 2.at n=42A350846