|
| |
|
|
A373672
|
|
Length of the n-th maximal antirun of non-prime-powers.
|
|
13
|
|
|
|
5, 3, 1, 6, 1, 1, 2, 1, 3, 1, 3, 1, 2, 1, 1, 1, 3, 2, 2, 1, 3, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 3, 1, 3, 1, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
An antirun of a sequence (in this case A361102 or A024619 with 1) is an interval of positions at which consecutive terms differ by more than one.
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
EXAMPLE
|
The maximal antiruns of non-prime-powers begin:
1 6 10 12 14
15 18 20
21
22 24 26 28 30 33
34
35
36 38
39
40 42 44
45
46 48 50
|
|
|
MATHEMATICA
|
Length/@Split[Select[Range[100], !PrimePowerQ[#]&], #1+1!=#2&]//Most
|
|
|
CROSSREFS
|
For prime antiruns we have A027833.
For squarefree runs we have A120992.
For prime-power runs we have A174965.
For composite antiruns we have A373403.
For antiruns of prime-powers:
For antiruns of non-prime-powers:
- length A373672 (this sequence), firsts (3,7,2,25,1,4)
A057820 gives first differences of consecutive prime-powers, gaps A093555.
A356068 counts non-prime-powers up to n.
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
