[go: up one dir, main page]

login
A355942
Numbers k such that k is a multiple of A326042(k).
3
1, 2, 5, 6, 10, 14, 24, 29, 30, 38, 55, 58, 70, 86, 102, 110, 113, 120, 145, 168, 174, 190, 220, 226, 261, 290, 312, 330, 362, 370, 406, 430, 438, 456, 510, 522, 565, 574, 660, 678, 696, 758, 770, 790, 840, 870, 1032, 1055, 1102, 1130, 1305, 1320, 1540, 1560, 1582, 1595, 1608, 1630, 1711, 1810, 2030, 2088, 2090, 2110
OFFSET
1,2
COMMENTS
If both x and y are terms and gcd(x, y) = 1, then x*y is also present.
Applying A003961 to these terms and sorting into ascending order gives A348943.
FORMULA
{k | A326042(k) divides k}.
PROG
(PARI) A355942(n) = (1==A348942(n));
CROSSREFS
Positions of 1's in A348942.
Sequence in context: A316946 A005984 A172186 * A178761 A274037 A227975
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jul 23 2022
STATUS
approved