OFFSET
1,1
COMMENTS
Positive integers that have exactly seven odd divisors.
Numbers n such that the symmetric representation of sigma(n) has 7 subparts. - Omar E. Pol, Dec 28 2016
Numbers that can be formed in exactly 6 ways by summing sequences of 2 or more consecutive positive integers. - Julie Jones, Aug 13 2018
Numbers of the form p^6 * 2^k where p is an odd prime. - David A. Corneth, Aug 14 2018
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10000
FORMULA
A001227(a(n)) = 7.
PROG
(PARI) isok(n) = sumdiv(n, d, (d%2)) == 7; \\ Michel Marcus, Apr 03 2016
(PARI) upto(n) = {my(res = List()); forprime(p = 3, sqrtnint(n, 6), listput(res, p^6)); q = #res; for(i = 1, q, odd = res[i]; for(j = 1, logint(n \ odd, 2), listput(res, odd <<= 1))); listsort(res); res} \\ David A. Corneth, Aug 14 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, Apr 03 2016
EXTENSIONS
More terms from Michel Marcus, Apr 03 2016
STATUS
proposed