|
| |
|
|
A119654
|
|
a(n) is the smallest number that starts a consecutive block of n numbers with at least n prime divisors (counting multiplicity) each.
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(6) is greater than 50000000. - Tanya Khovanova & Alexey Radul (tanyakh(AT)yahoo.com), Jul 30 2006
a(8) > 10^13. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Jan 31 2009]
|
|
|
EXAMPLE
| Consider a(3): 98 = 2*7*7 (3 prime divisors), 99 = 3*3*11 (3 prime divisors), 100 = 2*2*5*5 (4 prime divisors). Hence 98 starts a consecutive block of 3 numbers with at least 3 prime divisors each. 98 is the smallest such number.
|
|
|
CROSSREFS
| Sequence in context: A001697 A006069 A052457 * A173976 A008926 A136468
Adjacent sequences: A119651 A119652 A119653 * A119655 A119656 A119657
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| Tanya Khovanova & Alexey Radul (tanyakh(AT)yahoo.com), Jul 28 2006
|
|
|
EXTENSIONS
| a(6) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 07 2008
a(7) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Jan 31 2009
|
| |
|
|
