Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073679
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

0,1

COMMENT

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.

EXAMPLE

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

CROSSREFS

Adjacent sequences: A073676 A073677 A073678 this_sequence A073680 A073681 A073682

Sequence in context: A084336 A094750 A057988 this_sequence A118689 A118692 A020706

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 11 2002

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research