Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Oct 30 2019 17:05:06
%S 3,8,21,56,150,408,1099,2984,8109,22030,59884,162756,442416,1202614,
%T 3269025,8886112,24154960,65659986,178482314,485165200,1318815750,
%U 3584912848,9744803461,26489122152,72004899350,195729609452
%N a(n) = smallest multiple of n which is > exp(n).
%F a(n) = n * ceiling(e^n/n) = n* (A107316(n) +1)
%t f[n_] := n*Ceiling[Exp[n]/n];Array[f, 28] (* _Ray Chandler_, Feb 19 2007 *)
%t f[n_] := n - First@Mod[Exp[n], n]; Array[f, 27] (* _Robert G. Wilson v_ *)
%Y Cf. A128104, A107316.
%K nonn
%O 1,1
%A _Leroy Quet_, Feb 14 2007
%E Extended by _Robert G. Wilson v_ and _Ray Chandler_, Feb 19 2007