login
This site is supported by donations 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
4, 6, 9, 14, 21, 32, 45, 62, 81, 104, 133, 164, 201, 242, 285, 332, 385, 444, 505, 572, 645, 716, 795, 878, 975, 1064, 1165, 1268, 1375, 1484, 1611, 1724, 1855, 1992, 2149, 2288, 2439, 2588, 2751, 2918, 3091, 3270, 3451, 3642, 3835, 4032, 4255, 4454, 4665 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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.

LINKS

Table of n, a(n) for n=0..48.

EXAMPLE

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

CROSSREFS

Sequence in context: A057988 A175587 A175709 * A257559 A118689 A118692

Adjacent sequences:  A073676 A073677 A073678 * A073680 A073681 A073682

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Aug 11 2002

EXTENSIONS

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

STATUS

approved

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 April 25 16:08 EDT 2019. Contains 322461 sequences. (Running on oeis4.)