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!)
A082281 a(1) = 1, a(2) = 2; then a(n) = smallest number such that there are a(n-1) composite numbers between a(n) and a(n+1) exclusive. 2

%I #12 Nov 30 2019 02:04:37

%S 1,2,5,9,17,29,52,91,156,268,456,775,1309,2198,3696,6184,10347,17247,

%T 28740,47783,79377,131681,218222,361287,597587,987563,1630852,2691146,

%U 4437802,7313610

%N a(1) = 1, a(2) = 2; then a(n) = smallest number such that there are a(n-1) composite numbers between a(n) and a(n+1) exclusive.

%H Chai Wah Wu, <a href="/A082281/b082281.txt">Table of n, a(n) for n = 1..95</a>

%Y Cf. A082278, A082279, A082280.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Apr 13 2003

%E More terms from _Diana L. Mecum_, Jul 09 2007

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 March 28 08:02 EDT 2024. Contains 371236 sequences. (Running on oeis4.)