|
Search: id:A093549
|
|
|
| A093549 |
|
a(n) is the smallest number m such that each of the numbers m-1, m and m+1 has n distinct prime divisors. |
|
+0
5
|
| |
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a[n_] := (For[m=2, !(Length[FactorInteger[m-1]]==n && Length[FactorInteger[m]]==n&&Length[FactorInteger[m+1]]==n), m++ ];m)
|
|
EXAMPLE
|
a(3) =645 because 644=2^2*7*23; 645=3*5*43; 646=2*17*19
and 645 is the smallest number m such that each of the numbers
m-1, m & m+1 has 3 distinct prime divisors.
|
|
MATHEMATICA
|
a[n_] := (For[m=2, !(Length[FactorInteger[m-1]]==n && Length[FactorInteger[m]]==n&&Length[FactorInteger[m+1]]==n), m++ ]; m); Do[Print[a[n]], {n, 7}]
|
|
CROSSREFS
|
Cf. A093550, A052215, A093548.
Sequence in context: A135327 A128679 A111432 this_sequence A012044 A098918 A001699
Adjacent sequences: A093546 A093547 A093548 this_sequence A093550 A093551 A093552
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Apr 07 2004
|
|
EXTENSIONS
|
a(7) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 07 2008
|
|
|
Search completed in 0.002 seconds
|
