The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182076 Smallest number k such that the difference between the greatest prime divisor of k and the product of the other distinct prime divisors equals n. 1
 2, 3, 10, 5, 14, 7, 78, 33, 22, 11, 26, 13, 114, 51, 34, 17, 38, 19, 290, 69, 46, 23, 174, 145, 186, 87, 58, 29, 62, 31, 222, 185, 430, 111, 74, 37, 258, 123, 82, 41, 86, 43, 530, 141, 94, 47, 318, 265, 590, 159, 106, 53, 354, 295, 366, 177, 118, 59, 122, 61 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = n+1 if n+1 is prime. LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 EXAMPLE a(7) = 78 because the distinct prime divisors of 78 are {2, 3, 13} and 13 - 2*3 = 7. MAPLE with(numtheory):for n from 1 to 60 do:ii:=0:for k from 2 to 200000 while(ii=0) do:x:=factorset(k):m:=nops(x): s:=product ('x[i] ', 'i'=1..m-1):if s+n = x[m]  then printf(`%d, `, k):ii:=1:else fi:od: od: PROG (PARI) a(n)=my(t); for(k=n+1, 4<

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 April 15 23:04 EDT 2021. Contains 343007 sequences. (Running on oeis4.)