[go: up one dir, main page]

login
A365429
a(n) = 1 if the divisors of n increase by a factor of at most 2, otherwise 0.
2
1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1
OFFSET
1
FORMULA
a(n) <= A322860(n). [Conjectured, see comment in A174973]
PROG
(PARI) A365429(n) = { my(d=divisors(n)); for(i=2, #d, if(d[i]>2*d[i-1], return(0))); (1); }; \\ From "is" function given in A174973
CROSSREFS
Characteristic function of A174973.
Cf. A322860.
Sequence in context: A322585 A326956 A341629 * A322860 A353766 A178225
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 22 2023
STATUS
approved