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!)
A156768 a(1)=2, a(n+1) is the smallest prime > n + smallest digit of n-th prime*smallest digit of n. 0

%I #6 Mar 30 2012 18:52:32

%S 2,5,11,19,37,11,13,17,17,29,11,13,17,17,19,23,23,23,23,29,23,29,37,

%T 31,41,41,29,29,29,31,31,37,37,37,41,41,41,41,43,43,41,43,47,47,53,53,

%U 53,53,59,59,53,59,59,59,59,67,67,71,67,71,61,67,67,67,71,71,73,79,89,89

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

%e 2, 3(=3=1+2*1), 11(>8=2+3*2), 7(=7=3+1*4), 37(>32=4+7*4), etc.

%Y Cf. A000040, A156672.

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Feb 15 2009

%E Corrected by _R. J. Mathar_, Feb 26 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 24 13:07 EDT 2024. Contains 371945 sequences. (Running on oeis4.)