|
Search: id:A093550
|
|
|
| A093550 |
|
a(n) is the smallest number m such that each of the numbers m-1, m and m+1 is a product of n distinct primes. |
|
+0
6
|
| |
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
Each term of this sequence is of the form 4k+2.
|
|
LINKS
|
Jacques Tramu, Puzzle 371
|
|
FORMULA
|
<< NumberTheory`NumberTheoryFunctions`; a[n_] := (For[m=1, !(Length[FactorInteger[4m+1]]==n && SquareFreeQ[4m+1] && Length[FactorInteger[4m+2]]==n && SquareFreeQ[4m+2] && Length[FactorInteger[4m+3]]==n && SquareFreeQ[4m+3]), m++ ]; 4m+2)
|
|
EXAMPLE
|
a(5)=16467034 because each of the three numbers 16467034-1, 16467034 & 16467034+1 are products of 5 distinct primes (16467033=3*11*17*149*197, 16467034=2*19*23*83*227, 16467035=5*13*37*41*167) and 16467034 is the smallest such number.
|
|
MATHEMATICA
|
<< NumberTheory`NumberTheoryFunctions`; a[n_] := (For[m=1, !(Length[FactorInteger[4m+1]]==n && SquareFreeQ[4m+1] && Length[FactorInteger[4m+2]]==n && SquareFreeQ[4m+2] && Length[FactorInteger[4m+3]]==n && SquareFreeQ[4m+3]), m++ ]; 4m+2); Do[Print[a[n]], {n, 2, 6}]
|
|
CROSSREFS
|
Cf. A093549, A052215, A093548.
Sequence in context: A091761 A009978 A041545 this_sequence A123790 A086881 A056566
Adjacent sequences: A093547 A093548 A093549 this_sequence A093551 A093552 A093553
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Apr 07 2004, corrected Aug 26 2006; a(7) added from Jacques Tramu's web site, Aug 26 2006
|
|
|
Search completed in 0.002 seconds
|
