20462

Appears in sequences

• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 22.at n=12A031700
• Starting from generation 8 add previous and next term yielding generation 9.at n=21A048455
• a(1)=1, a(n) = n * (Sum_{k=1..n-1} a(k)) - 2.at n=7A082427
• Antidiagonal sums of table A083047.at n=15A083049
• Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). Sequence gives numbers m such that m = Sum_{d|m, d>1} R_{d}(m).at n=7A092122
• Zero followed by partial sums of A008865.at n=39A145067
• a(n) = 169*n^2 + 13.at n=11A158548
• Number of permutations of length n which avoid the patterns 4123 and 2341.at n=9A165531
• a(n) = 121*n^2 + n.at n=12A173267
• Numbers k such that 4*5^k + 1 is prime.at n=7A204322
• Number of length n 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=5A258623
• Number of length n 1..(6+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=5A258629
• T(n,k)=Number of length n 1..(k+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=60A258631
• Number of length 6 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=5A258637
• a(n) = [x^n] (1 + theta_3(x))^n/(2^n*(1 - x)), where theta_3() is the Jacobi theta function.at n=11A302862