[go: up one dir, main page]

login
Search: a361118 -id:a361118
     Sort: relevance | references | number | modified | created      Format: long | short | data
Let b = A360519; let Lg = gcd(b(n-1),b(n)), Rg = gcd(b(n),b(n+1)); let L(n) = prod_{primes p|Lg} p-part of b(n), R(n) = prod_{primes p|Rg} p-part of b(n), M(n) = b(n)/(L(n)*R(n)); sequence gives L(n).
+10
3
1, 2, 5, 7, 3, 4, 5, 11, 9, 2, 7, 11, 3, 5, 2, 11, 13, 3, 4, 7, 13, 5, 2, 17, 7, 9, 2, 13, 17, 3, 2, 19, 5, 3, 4, 11, 17, 25, 2, 23, 3, 19, 4, 13, 3, 5, 2, 29, 3, 31, 8, 7, 3, 37, 4, 17, 3, 41, 16, 5, 23, 7, 12, 5, 29, 49, 2, 3, 43, 25, 2, 3, 47, 5, 8, 3, 7, 19, 2, 27, 5, 31
OFFSET
2,2
COMMENTS
The p-part of a number k is the highest power of p that divides k. For example, the 2-part of 24 is 8, the 3-part is 3.
One can think of A360519 as a chain of circles, each circle linked to its neighbors to the left and the right. The n-th term b(n) = A360519(n) is a product L(n)*M(n)*R(n), where L(n) is the part of b(n) sharing primes with the term to the left, R(n) the part sharing primes with the term to the right, and M(n) is the rest of b(n).
By definition of A360519, the set of primes in L(n) is disjoint from the primes in R(n).
LINKS
MAPLE
# Suppose bW is a list of the terms of A360519.
# Then f3(bW[n-1], bW[n], bW[n+1]); returns [L(n), M(n), R(n)] where:
with(numtheory);
f3:=proc(a, b, c)
local lefta, midb, rightc, i, p, pa, pc, ta, tb, tc, t1, t2;
ta:=a; tb:=b; tc:=c;
# left
t1:=igcd(a, b);
t2:=factorset(t1);
t2:=convert(t2, list);
lefta:=1;
for i from 1 to nops(t2) do
p:=t2[i];
while (tb mod p) = 0 do lefta:=lefta*p; tb:=tb/p; od;
od:
# right
t1:=igcd(b, c);
t2:=factorset(t1);
t2:=convert(t2, list);
rightc:=1;
for i from 1 to nops(t2) do
p:=t2[i];
while (tb mod p) = 0 do rightc:=rightc*p; tb:=tb/p; od;
od:
# middle
midb:=b/(lefta*rightc);
[lefta, midb, rightc];
end; # N. J. A. Sloane, Mar 09 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
Let b = A360519; let Lg = gcd(b(n-1),b(n)), Rg = gcd(b(n),b(n+1)); let L(n) = prod_{primes p|Lg} p-part of b(n), R(n) = prod_{primes p|Rg} p-part of b(n), M(n) = b(n)/(L(n)*R(n)); sequence gives M(n).
+10
3
3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 11, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 5, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1
OFFSET
2,1
COMMENTS
The p-part of a number k is the highest power of p that divides k. For example, the 2-part of 24 is 8, the 3-part is 3.
Since so many of the initial terms are 1, we show more than the usual number of terms in the DATA section.
Conjecture: All terms are odd, and every odd number eventually appears.
LINKS
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
Let b = A360519; let Lg = gcd(b(n-1),b(n)), Rg = gcd(b(n),b(n+1)); let L(n) = prod_{primes p|Lg} p-part of b(n), R(n) = prod_{primes p|Rg} p-part of b(n), M(n) = b(n)/(L(n)*R(n)); sequence gives R(n).
+10
3
2, 5, 7, 3, 4, 5, 11, 3, 2, 7, 11, 9, 5, 8, 11, 13, 3, 8, 7, 13, 5, 2, 17, 7, 9, 4, 13, 17, 3, 2, 19, 5, 9, 16, 11, 17, 5, 2, 23, 3, 19, 4, 13, 9, 25, 2, 29, 3, 31, 2, 7, 3, 37, 2, 17, 9, 41, 2, 5, 23, 7, 12, 5, 29, 7, 2, 27, 43, 5, 4, 3, 47, 5, 2, 9, 49, 19, 8, 3, 5, 31, 4, 43, 7
OFFSET
2,1
COMMENTS
The p-part of a number k is the highest power of p that divides k. For example, the 2-part of 24 is 8, the 3-part is 3.
LINKS
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
a(n) = gcd(A361321(n), A361321(n+1)).
+10
3
1, 2, 5, 7, 3, 11, 2, 7, 13, 3, 5, 11, 7, 2, 13, 5, 17, 2, 19, 3, 17, 7, 10, 3, 23, 7, 19, 5, 2, 23, 13, 11, 2, 29, 5, 3, 2, 31, 5, 23, 2, 37, 5, 3, 29, 7, 2, 41, 3, 31, 7, 2, 43, 3, 37, 7, 2, 47, 3, 53, 2, 59, 3, 61, 2, 65, 3, 67, 2, 71, 3, 73, 2, 79, 3, 11, 17, 2, 19, 11, 23, 2, 17, 13, 19, 2
OFFSET
1,2
LINKS
EXAMPLE
A361321(3) = 10, A361321(4) = 35, so a(3) = gcd(10,35) = 5;
KEYWORD
nonn
STATUS
approved

Search completed in 0.006 seconds