|
|
|
|
#30 by Giovanni Resta at Sun Aug 19 06:28:25 EDT 2018
|
|
|
|
#29 by Joerg Arndt at Sun Aug 19 06:27:21 EDT 2018
|
|
|
|
#28 by David A. Corneth at Tue Aug 14 04:42:20 EDT 2018
|
|
|
Discussion
|
Tue Aug 14
| 10:38
| Julie Jones: Thank you
|
|
|
|
#27 by David A. Corneth at Tue Aug 14 04:41:52 EDT 2018
|
| LINKS
|
David A. Corneth, <a href="/A267697/b267697.txt">Table of n, a(n) for n = 1..10000</a>
|
|
|
|
#26 by David A. Corneth at Tue Aug 14 04:34:09 EDT 2018
|
| PROG
|
(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
|
|
|
|
#25 by David A. Corneth at Tue Aug 14 04:26:26 EDT 2018
|
| PROG
|
(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
|
|
|
|
#24 by David A. Corneth at Tue Aug 14 04:08:30 EDT 2018
|
| COMMENTS
|
Numbers that can be formed in exactly 6 ways by summing sequences of 2 or more consecutive positive integers. - Julie Jones, Aug 13 2018
|
| STATUS
|
proposed
editing
|
|
|
Discussion
|
Tue Aug 14
| 04:08
| David A. Corneth: without positive the statement is incorrect.
|
|
|
|
#23 by David A. Corneth at Tue Aug 14 03:56:33 EDT 2018
|
|
|
|
#22 by David A. Corneth at Tue Aug 14 03:53:29 EDT 2018
|
| PROG
|
(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
|
| KEYWORD
|
nonn,easy,changed
|
|
|
|
#21 by David A. Corneth at Tue Aug 14 03:48:10 EDT 2018
|
| COMMENTS
|
Numbers of the form p^6 * 2^k where p is an odd prime. - David A. Corneth, Aug 14 2018
|
| STATUS
|
proposed
editing
|
|
|
|