cp's OEIS Frontend

A100332 a(n) is the smallest positive integer for which the fractional part of exp(a(n)) begins with n.

%I A100332 #7 Dec 14 2015 08:56:46
%S A100332 11,14,2,5,4,7,1,24,8,363,61,140,18,11,56,281,204,81,391,624,154,36,
%T A100332 173,23,98,63,181,14,139,37,60,82,153,519,54,315,15,2,13,20,5,6,67,
%U A100332 297,50,10,28,21,118,115,172,16,487,272,55,93,258,249,4,99,87,282,7,73,134,242
%N A100332 a(n) is the smallest positive integer for which the fractional part of exp(a(n)) begins with n.
%H A100332 Robert Israel, <a href="/A100332/b100332.txt">Table of n, a(n) for n = 1..3908</a>
%e A100332 a(1)=11 because exp(11)=59874.1... and no other 1<= k < 11 gives (exp(k)) whose fractional part starts with 1;
%e A100332 a(2)=14 because exp(14)=1202604.2...;
%e A100332 a(7)=1 because exp(1)=2.7...;
%p A100332 V:= Array(0..999):
%p A100332 count:= 0:
%p A100332 for n from 1 while count < 999 do
%p A100332   d:= floor(log10(exp(n)));
%p A100332   Digits:= d+10;
%p A100332   for m from 1 to 3 do
%p A100332     x:= floor(10^m*exp(n)) mod 10^m;
%p A100332     if x >= 10^(m-1) and V[x] = 0 then
%p A100332       count:= count+1;
%p A100332       V[x]:= n
%p A100332     fi
%p A100332   od;
%p A100332 od:
%p A100332 seq(V[i],i=1..999); # _Robert Israel_, Dec 14 2015
%Y A100332 Cf. A100322 for analogous sequence for Pi.
%K A100332 base,nonn
%O A100332 1,1
%A A100332 Mark Hudson (mrmarkhudson(AT)hotmail.com), Nov 17 2004