46865

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=26A078455
• n times n+2 gives the concatenation of two numbers m and m-9.at n=4A116226
• a(n) = n^3 + 114 * n.at n=34A122562
• Smallest m such that A123699(m) = n.at n=21A123700
• Expansion of Product_{k>=1} 1/(1 - k^2*x^(k^2)).at n=31A282209