|
|
A373200
|
|
Numbers k such that the k-th maximal antirun of squarefree numbers has length different from all prior maximal antiruns. Sorted positions of first appearances in A373127.
|
|
7
|
|
|
1, 3, 8, 10, 19, 162, 1633, 1853, 2052, 26661, 46782, 1080330, 3138650
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
An antirun of a sequence (in this case A005117) is an interval of positions at which consecutive terms differ by more than one.
|
|
LINKS
|
|
|
EXAMPLE
|
The maximal antiruns of squarefree numbers begin:
1
2
3 5
6
7 10
11 13
14
15 17 19 21
22
23 26 29
30
31 33
34
35 37
The a(n)-th rows are:
1
3 5
15 17 19 21
23 26 29
47 51 53 55 57
483 485 487 489 491 493
|
|
MATHEMATICA
|
t=Length/@Split[Select[Range[10000], SquareFreeQ], #1+1!=#2&]//Most;
Select[Range[Length[t]], FreeQ[Take[t, #-1], t[[#]]]&]
|
|
CROSSREFS
|
For squarefree runs we have the triple (1,3,5), firsts of A120992.
For prime runs we have the triple (1,2,3), firsts of A175632.
For nonsquarefree runs we have A373199 (assuming sorted), firsts of A053797.
For composite antiruns we have the triple (1,2,7), firsts of A373403.
Cf. A006512, A007674, A049093, A068781, A072284, A077641, A174965, A251092, A373198, A373408, A373411.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|