|
Search: id:A078143
|
|
|
| A078143 |
|
Smallest term of a run of at least 9 consecutive integers which are not square-free. |
|
+0
5
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence includes an infinite family of arithmetic progressions. Such AP's can be constructed to each term, with large differences [like squares of primorials, A061742(7)]. It is necessary to solve suitable systems of linear Diophantine equations. E.g.: arithmetic progression subsequences of starting 9-chains is {mk+69147868+j} where j=0..8, m=510510^2 because square prime factors of a(4)+j=68147868+j are 4, 49, 121, 169, 4, 9, 289, 25, 4 resp. for j=0..8; k goes to infinity; 7th primorial is sufficient, 9th is not necessary.Construction is provable for arbitrary long [>9] chains. - Labos E. (labos(AT)ana.sote.hu), Nov 25 2002
|
|
MATHEMATICA
|
s9[x_] := Apply[Plus, Table[Abs[MoebiusMu[x+j]], {j, 0, 8}]]; Do[If[Equal[s9[n], 0], Print[n]], {n, 8000000, 1000000000}]
|
|
CROSSREFS
|
Cf. A013929, A045882, A049535, A051681, A077640, A077647.
Cf. A049535, A077647, A078143.
Sequence in context: A049362 A081639 A015378 this_sequence A106787 A105012 A015350
Adjacent sequences: A078140 A078141 A078142 this_sequence A078144 A078145 A078146
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 22 2002
|
|
|
Search completed in 0.002 seconds
|
