44978

Appears in sequences

• a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)).at n=13A078455
• The number of ordered ways to achieve a score of n in darts.at n=13A167213
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 1, where a(0) = 1, a(1) = 5, b(0) = 2, b(1) = 3, b(2) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=18A295959
• G.f.: Product_{k>=1} (1 + x^(2*k^2)) / (1 - x^k).at n=37A385009