This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182011 a(n) is the smallest number k such that the difference between the greatest prime divisor of k and the sum of the other distinct prime divisors equals n. 3
 6, 2, 3, 21, 5, 55, 7, 33, 22, 39, 11, 85, 13, 51, 34, 57, 17, 115, 19, 69, 46, 203, 23, 145, 1295, 87, 58, 93, 29, 259, 31, 185, 615, 111, 74, 205, 37, 123, 82, 129, 41, 235, 43, 141, 94, 371, 47, 265, 1239, 159, 106, 413, 53, 295, 2345, 177, 118, 183, 59, 469 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = n if n is prime. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 EXAMPLE a(1) = 6 because 6 = 2*3 and 3 - 2 = 1. CROSSREFS Cf. A001221. Sequence in context: A201280 A248274 A267568 * A086048 A239578 A248273 Adjacent sequences:  A182008 A182009 A182010 * A182012 A182013 A182014 KEYWORD nonn AUTHOR Michel Lagneau, Apr 09 2012 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.

Last modified October 22 08:00 EDT 2019. Contains 328315 sequences. (Running on oeis4.)