login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085273 Difference between n-th composite number and its largest prime divisor. 2
2, 3, 6, 6, 5, 9, 7, 10, 14, 15, 15, 14, 11, 21, 20, 13, 24, 21, 25, 30, 22, 17, 28, 33, 19, 26, 35, 35, 33, 40, 23, 45, 42, 45, 34, 39, 51, 44, 49, 38, 29, 55, 31, 56, 62, 52, 55, 51, 46, 63, 69, 37, 70, 57, 66, 65, 75, 78, 41, 77, 68, 43, 58, 77, 85, 78, 69, 62, 47, 76, 93, 91 (list; graph; refs; listen; history; internal format)
OFFSET

4,1

EXAMPLE

For 91=7*13 we have 91-13 = 78

For 92=2*2*23 we have 92-23 = 69

PROG

(PARI) cminusp2(n) = { for(x=2, n, forstep(p=x, 2, -1, if(isprime(p) & x%p==0 & isprime(x)==0, print1(x-p, ", "); break); ) ) }

CROSSREFS

Cf. A085271.

Sequence in context: A124498 A197334 A113399 * A151850 A078706 A077082

Adjacent sequences:  A085270 A085271 A085272 * A085274 A085275 A085276

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Aug 12 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.