|
%I #11 Dec 10 2023 17:42:41
%S 1,9,18,27,45,54,70,75,84,125,135,144,153,198,279,366,390,392,423,459,
%T 747,837,855,858,891,927,1269,1341,1494,1503,1690,1899,2097,2241,2493,
%U 2604,2679,2763,2781,2888,2979,2988,3177,3411,3507,3879,4023,4041,4050,4482,4491,4509,4707,5067,5283,5463,5679,5697,5817,5877,5982,6093
%N Numbers n for which A329639(n) is equal to gcd(A329638(n), A329639(n)).
%C After the initial 1, numbers n such that A329638(n) is a multiple of A329639(n).
%H Antti Karttunen, <a href="/A329640/b329640.txt">Table of n, a(n) for n = 1..85</a> (based on Hans Havermann's factorization of A156552)
%o (PARI) isA329640(n) = { my(u=A329639(n)); (u==gcd(A329638(n), u)); };
%Y Cf. A156552, A329638, A329639, A329641.
%Y Cf. A324201 (a subsequence).
%Y Cf. also A326141.
%K nonn
%O 1,2
%A _Antti Karttunen_, Nov 21 2019
|
