login
A347246
a(n) = 1 if the greatest prime factor of A000593(n) [sum of odd divisors of n] is at least as large as the greatest prime factor of n itself, otherwise a(n) = 0.
6
1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1
OFFSET
1
FORMULA
a(n) = [A006530(A000593(n)) >= A006530(n)], where [ ] is the Iverson bracket.
For n > 1, a(n) = 1 iff A347245(n) = 1.
PROG
(PARI)
A006530(n) = if(1==n, n, my(f=factor(n)); f[#f~, 1]);
A000265(n) = (n >> valuation(n, 2));
A000593(n) = sigma(A000265(n));
A347246(n) = (A006530(A000593(n))>=A006530(n));
CROSSREFS
Characteristic function of A347247. A347248 gives the positions of zeros.
Cf. also A336352.
Sequence in context: A326499 A379678 A104124 * A052434 A369034 A015241
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 28 2021
STATUS
approved