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!)
A073679 a(1) = 4, a(n+1) is the smallest composite number > a(n) such that all of the differences a(n+1)-a(n) are distinct primes. 0

%I #2 Dec 05 2013 19:55:31

%S 4,6,9,14,21,32,45,62,81,104,133,164,201,242,285,332,385,444,505,572,

%T 645,716,795,878,975,1064,1165,1268,1375,1484,1611,1724,1855,1992,

%U 2149,2288,2439,2588,2751,2918,3091,3270,3451,3642,3835,4032,4255,4454,4665

%N a(1) = 4, a(n+1) is the smallest composite number > a(n) such that all of the differences a(n+1)-a(n) are distinct primes.

%C For the first 20 terms the differences are the first 19 primes in that order (from 2 to 67). But a(20) + 71 = 572 + 71 is a prime, so a(21) = 572 + 73.

%e a(18) = 444 = a(17) + 59 = 385 + 59. All the primes <59 have already been used.

%K nonn

%O 0,1

%A _Amarnath Murthy_, Aug 11 2002

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 24 2003

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