|
| |
|
|
A372043
|
|
a(1) = 1. For n > 1 a(n) is the smallest unused k such that A007947(k*a(n-1)) is novel.
|
|
1
|
|
|
|
1, 2, 3, 5, 4, 7, 6, 10, 11, 8, 13, 9, 17, 12, 19, 14, 15, 21, 22, 18, 23, 16, 29, 20, 26, 24, 31, 25, 28, 34, 30, 33, 27, 37, 32, 38, 35, 39, 40, 41, 36, 43, 42, 46, 44, 47, 45, 51, 49, 52, 53, 48, 58, 55, 56, 57, 50, 59, 54, 61, 60, 62, 63, 67, 64, 68, 65, 66
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
In other words least novel k such that the radical of (k*a(n-1)) has not been seen earlier as the radical of the product of any pair of consecutive terms (radical means A007947, often abbreviated as "rad" in formulae, see Example).
This sequence is a permutation of the positive integers (A000027), with primes in order.
Initially powers of 2 (>= 4) are flanked by primes: (5,4,7); (11,8,13); (23,16,29), but this pattern does not continue past 16.
a(n) = k = p^m implies a(n-1) is indivisible by p prime.
a(n) = k = 2^m implies a(n-1) is odd.
a(n) = k = p implies a(n-1) is not a power of p, hence, there exist no adjacent powers of the same prime in the sequence.
(End)
|
|
|
LINKS
|
Michael De Vlieger, Plot a(n) at (x,y) = (n mod 360, -floor(n/360)) for n = 1..129600, showing primes in red, prime powers in gold, squarefree composites in green, and numbers neither squarefree nor prime powers in blue and black, with black additionally signifying powerful numbers that are not prime powers.
|
|
|
EXAMPLE
|
a(1) = 1, rad(1) = 1 so a(2) = 2, the least unused number such that rad(2*a(1)) = 2 and no product of two consecutive prior terms has rad = 2.
Likewise a(3) = 3 since rad(2*3) = 6 is novel.
a(4) cannot be 4 because then we would have rad(3*4) = 6 and this is not novel (see a(3)). However 5 works since rad(3*5) = 15, and this is novel.
|
|
|
MATHEMATICA
|
nn = 120; c[_] := False; q[_] := False;
f[x_] := f[x] = Times @@ FactorInteger[x][[All, 1]];
a[1] = j = 1; c[1] = q[1] = True; u = 2;
Do[m = u; While[Or[c[Set[k, f[j m]]], q[m]], m++];
Set[{a[n], c[k], q[m], j}, {m, True, True, m}];
If[m == u, While[q[u], u++]], {n, 2, nn}];
|
|
|
PROG
|
(PARI) rad(n) = factorback(factorint(n)[, 1]); \\ A007947
leastk(w, prec, va) = my(k=1); while (select(x->(x==rad(k*prec)), w) || select(x->(x==k), va), k++); k;
lista(nn) = my(va = vector(nn)); va[1] = 1; for (n=2, nn, my(w = vector(n-1, k, rad(va[k+1]*va[k]))); va[n] = leastk(w, va[n-1], va); ); va; \\ Michel Marcus, Apr 19 2024
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
