This site is supported by donations to The OEIS Foundation. Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A008366 Smallest prime factor is >= 17. 10
 1, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Also the 17-rough numbers: positive integers that have no prime factors less than 17. - Michael B. Porter, Oct 10 2009 a(n) - (1001/192) n is periodic with period 5760. - Robert Israel, Mar 18 2016 From Peter Bala, May 12 2018: (Start) The product of two 17-rough numbers is a 17-rough number and the prime factors of a 17-rough number are 17-rough numbers. Let k equal either 13, 14, 15 or 16. Then the product of k numbers n*(n + a)*(n + 2*a)*...*(n + (k-1)*a) in arithmetical progression is divisible by k! for all integer n if and only if a is a 17-rough number. The sequence terms satisfy the congruence x^60 = 1 (mod 30030), where 30030 = 2*3*5*7*11*13. (End) LINKS Robert Israel, Table of n, a(n) for n = 1..10000 P. Bala, A property of p-rough numbers Benedict Irwin, Generating Function Eric Weisstein's World of Mathematics, Rough Number FORMULA Numbers n > 1 such that ((Sum_{k=1..n} k^10) mod n = 0) and ((Sum_{k=1..n} k^12) mod n = 0) (conjecture). - Gary Detlefs, Dec 27 2011 a(n) = a(n-1) + a(n-5760) - a(n-5761). - Vaclav Kotesovec, Mar 18 2016 G.f: x*P(x)/(1 - x - x^5760 + x^5761) where P(x) is a polynomial of degree 5760. - Benedict W. J. Irwin, Mar 23 2016 MAPLE for i from 1 to 500 do if gcd(i, 30030) = 1 then print(i); fi; od; MATHEMATICA Select[ Range[ 300 ], GCD[ #1, 30030 ]==1& ] PROG (PARI) isA008366(n) = gcd(n, 30030)==1 \\ Michael B. Porter, Oct 10 2009 CROSSREFS For k-rough numbers with other values of k, see A000027 A005408 A007310 A007775 A008364 A008365 A008366 A166061 A166063. - Michael B. Porter, Oct 10 2009 Cf. A005867. Sequence in context: A054484 A054796 A322275 * A126769 A092216 A180948 Adjacent sequences:  A008363 A008364 A008365 * A008367 A008368 A008369 KEYWORD nonn AUTHOR 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 December 6 14:15 EST 2019. Contains 329806 sequences. (Running on oeis4.)