login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111380 Smallest prime whose digital sum is equal to the n-th composite number not congruent to 0 (modulo 3). 3

%I

%S 13,17,19,59,79,389,499,997,1889,1999,6899,17989,8999,39989,49999,

%T 98999,199999,598999,599999,799999,2998999,2999999,4999999,9899999,

%U 19999999,29999999,59999999,189997999,389999999,689899999,699899999,998999999

%N Smallest prime whose digital sum is equal to the n-th composite number not congruent to 0 (modulo 3).

%H Chai Wah Wu, <a href="/A111380/b111380.txt">Table of n, a(n) for n = 1..100</a>

%Y Cf. A073867, A157695.

%K nonn,base

%O 1,1

%A _Stefan Steinerberger_, Nov 09 2005

%E Edited and extended by _Robert G. Wilson v_, Nov 10 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 11:52 EST 2018. Contains 318097 sequences. (Running on oeis4.)