|
Search: id:A140079
|
|
|
| A140079 |
|
Numbers n such that n and n+1 have 5 distinct prime factors. |
|
+0
3
|
|
| 254540, 310155, 378014, 421134, 432795, 483405, 486590, 486794, 488565, 489345, 507129, 522444, 545258, 549185, 558789, 558830, 567644, 577940, 584154, 591260, 598689, 627095, 634809, 637329, 663585, 666995, 667029, 678755, 687939, 690234
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Smallest number r such that r and r+1 have n distinct prime factors see A093548
|
|
LINKS
|
D. A. Goldston, S. W. Graham, J. Pintz, C. Y. Yildirim., Small gaps between almost primes, the parity problem and some conjectures of Erdos on consecutive integers.
|
|
MATHEMATICA
|
a = {}; Do[If[Length[FactorInteger[n]] == 5 && Length[FactorInteger[n + 1]] == 5, AppendTo[a, n]], {n, 1, 100000}]; a (*Artur Jasinski*)
|
|
CROSSREFS
|
Cf. A074851, A140077, A140078.
Adjacent sequences: A140076 A140077 A140078 this_sequence A140080 A140081 A140082
Sequence in context: A083628 A140967 A069176 this_sequence A034631 A147579 A087025
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), May 07 2008
|
|
|
Search completed in 0.002 seconds
|
