login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158055 a(1)=2, a(n+1) is the smallest prime > n*first digit of a(n). 1

%I #7 Mar 23 2020 19:15:18

%S 2,3,7,23,11,7,43,29,17,11,11,13,13,17,17,17,17,19,19,23,41,89,179,29,

%T 53,127,29,59,149,31,97,281,67,199,37,107,37,113,41,157,41,167,43,173,

%U 47,181,47,191,53,251,101,53,263,107,59

%N a(1)=2, a(n+1) is the smallest prime > n*first digit of a(n).

%H Robert Israel, <a href="/A158055/b158055.txt">Table of n, a(n) for n = 1..10000</a>

%p A[1]:= 2:

%p for n from 1 to 99 do A[n+1]:= nextprime(n*floor(A[n]/10^(ilog10(A[n])))) od:

%p seq(A[i],i=1..100); # _Robert Israel_, Mar 23 2020

%Y Cf. A000027, A000040, A156615.

%K nonn,base,look

%O 1,1

%A _Juri-Stepan Gerasimov_, Mar 12 2009

%E Corrected by _D. S. McNeil_, Mar 21 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)