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!)
 A085152 All prime factors of n and n+1 are <= 5. (Related to the abc conjecture.) 29
 1, 2, 3, 4, 5, 8, 9, 15, 24, 80 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Equivalently: Numbers n such that n(n+1) is 5-smooth. The ABC conjecture would imply that if the prime factors of A, B, C are prescribed in advance, then there is only a finite number of solutions to the equation A + B = C with gcd(A,B,C)=1 (indeed it would bound C to be no more than "roughly" the product of those primes). So in particular there ought to be only finitely many pairs of adjacent integers whose prime factors are limited to {2, 3, 5} (D. Rusin). This sequence is complete by a theorem of Stormer. See A002071. - T. D. Noe, Mar 03 2008 This is the 3rd row of the table A138180. It has 10 = A002071(3) = A145604(1)+A145604(2)+A145604(3) terms and ends with A002072(3) = 80. It is the union of all terms in rows 1 through 3 of the table A145605. It is a subsequence of A252494 and A085153. - M. F. Hasler, Jan 16 2015 LINKS MATHEMATICA Select[Range, FactorInteger[ # (# + 1)][[ -1, 1]] <= 5 &] (* T. D. Noe, Mar 03 2008 *) PROG (PARI) for(n=1, 99, vecmax(factor(n++)[, 1])<6 && vecmax(factor(n--+(n<2))[, 1])<6 && print1(n", ")) \\ This skips 2 if n+1 is not 5-smooth: twice as fast as the naive version. - M. F. Hasler, Jan 16 2015 CROSSREFS Cf. A002071, A145604, A138180, A145605, A002072, A085153, A252493, A252492. Sequence in context: A194714 A054168 A301464 * A264886 A287117 A286431 Adjacent sequences:  A085149 A085150 A085151 * A085153 A085154 A085155 KEYWORD nonn,fini,full AUTHOR Benoit Cloitre, Jun 21 2003 EXTENSIONS Edited by Dean Hickerson, Jun 30 2003 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 September 17 16:50 EDT 2021. Contains 347487 sequences. (Running on oeis4.)