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!)
A062280 a(1) = 1; a(n) = smallest multiple of n-th prime (n>1) with all odd digits. 1

%I #2 Dec 05 2013 19:54:54

%S 1,3,5,7,11,13,17,19,115,319,31,37,533,559,517,53,59,793,335,71,73,79,

%T 913,979,97,1111,515,535,1199,113,1397,131,137,139,1937,151,157,1793,

%U 3173,173,179,1991,191,193,197,199,9917,1115,1135,7557,5359,717,3133

%N a(1) = 1; a(n) = smallest multiple of n-th prime (n>1) with all odd digits.

%e a(9) = 115 as the ninth prime is 23.

%Y Cf. A062281.

%K nonn,base,easy

%O 1,2

%A _Amarnath Murthy_, Jun 18 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), Jun 20 2001

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 23 19:56 EDT 2024. Contains 371916 sequences. (Running on oeis4.)