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!)
A082280 a(1) = 1, then the smallest number such that there are a(n) composite numbers between a(n) and a(n+1) both excluded. 3

%I

%S 1,5,13,31,71,160,355,777,1681,3603,7677,16272,34323,72119,151036,

%T 315355,656823,1364925,2830706,5859765,12110519,24991695,51503762,

%U 106008953,217946295,447610014

%N a(1) = 1, then the smallest number such that there are a(n) composite numbers between a(n) and a(n+1) both excluded.

%H Chai Wah Wu, <a href="/A082280/b082280.txt">Table of n, a(n) for n = 1..65</a>

%t k = i = 1; Print[k]; Do[t = 0; While[t < k, i++; If[ !PrimeQ[i], t++ ]]; k = i = (i+1); Print[k], {n, 1, 25}] (* _Ryan Propper_, Jul 14 2005 *)

%Y Cf. A082278, A082279, A082281.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Apr 13 2003

%E More terms from _Ryan Propper_, Jul 14 2005

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 June 27 23:49 EDT 2022. Contains 354903 sequences. (Running on oeis4.)