Neil Sloane <njasloane@gmail.com> wrote:
Keith, Bearing in mind your remark about tuits, I created A327448 and A327449 for cubes and primes. If you have others (squares?), please post them here - or email them to me.
Thanks. I'd be more comfortable if someone else confirmed them. I lost a lot of confidence due to my screwup with the areas of plane-cube intersection polygons. I should really be trying to figure out where I went wrong on that rather than doing new stuff. (But new stuff is more fun.) Plus, I've been making a lot of careless errors this week due to being very short on sleep. (I'm short on sleep because a company has been dumping tons of dirt right across the street literally all night long every night, and slamming the dump truck tailgates, which is louder than a shotgun blast. I may have to hire a lawyer.) Allan Wechsler <acwacw@gmail.com> wrote:
I just spent ten minutes trying to partition the first n squares into three parts with equal sums.
I can plug any sequence whatsoever into my program. Maybe I can triple the number of OEIS sequences by plugging every OEIS sequence into it. :-) Bearing in mind the caveat above, here are my results for squares: Starting with n = 13: 1,0,0,0,137,211,0,0,0,3035,0,0,0,120465,259383 The unique solution with 13 is: 1 + 9 + 25 + 36 + 81 + 121 = 16 + 49 + 64 + 144 = 4 + 100 + 169