reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
David A. Corneth, <a href="/A267697/b267697.txt">Table of n, a(n) for n = 1..10000</a>
(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
(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
Numbers that can be formed in exactly 6 ways by summing sequences of 2 or more consecutive positive integers. - Julie Jones, Aug 13 2018
proposed
editing
editing
proposed
(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))); res} \\ David A. Corneth, Aug 14 2018
nonn,easy,changed
Numbers of the form p^6 * 2^k where p is an odd prime. - David A. Corneth, Aug 14 2018
proposed
editing