40323

Appears in sequences

• a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=26A070902
• a(1) = a(2) = 1; a(n) = a(n-1)! + a(n-2) for n > 2.at n=5A075849
• Length of list created by n substitutions k -> Range[-1-abs(k), abs(k)+1] starting with {1}.at n=6A084076
• Size of range [Smallest GF2X-Matula number coding a tree of n nodes, Largest GF2X-Matula number coding a tree of n nodes].at n=7A091241
• Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 8 and (k+9) mod 11 <> 1.at n=14A096026
• Generalized Catalan triangle of Riordan type, called C(1,2).at n=38A115193
• Sixth column of triangle A115193 (called C(1,2)).at n=5A115203
• Semiprimes (A001358) that are sums of distinct factorials.at n=40A115646
• a(n) = Sum_{d|n} (d-1)!.at n=8A358280
• Consecutive states of the linear congruential pseudo-random number generator (1021*s + 25673) mod 121500 when started at s=1.at n=34A385341