I am still searching...
I am looking by using this Python code:
Furthermore as noted by @elias
Reduced bounds from before I started a search...
Because
A lower value for the upper bound is:
Lowered further by @astralfenix to
This can be lowered a touch to
it got me down to 114 sheep and seems to have stalled (well it got me down to 116, but the lowest number in the set was 3, so I subtracted 2 off every number)
@TheBitByte I disagree with you on that, there are plenty of things in the OEIS that are intractable and in the middle ground between trivial and intractable
@EricTressler Hm, I was worried about some oscilations. I still can't really wrap my head around it, but it is probably gonna make my code shorter and more inefficient, which is good.
@EricTressler I disagree. I just answered one of those questions. Code was ready from OEIS itself and already golfed. I didn't have to do anything. If OEIS users can golf it, then so can anybody. Trivial question.
@TheBitByte I see you've come here only recently. Please note that many if not most users here have plenty of experience on this site, so if everyone is doing it wrong in your perspective, you might reconsider your perspective, instead of making accusatiosn.
@flawr help me find this reference, please? I don't actually have running code here, nor Matlab. Can you tell me the # cascades at t=4,8,12,16,20,24,28?
@EricTressler Ah right that might be unclear: I start with an empty matrix and put the number t in the middle. Then I apply a "cascading" function n times untill there are no values greater than 3. The cascading function just applies one cascading step on all the values that are greater than 3.
@DestructibleWatermelon On Android KitKat: (could be different for your model if you have an OEM skin, etc)
Open Settings, Open Storage, Check if you got "More Options" menu. Click on it, press USB settings or whatever it shows, select "MTP" or " Camera PTP", whatever your device calls it.
Then, connect your phone to Mac using the USB cable. Open Finder. There's a list of drives, right? "Look for Android File Transfer", and double click the icon.
@xnor the sandpile group consists of recurrent configurations. In the infinite grid with no sink, there are no recurrent configurations, so the sandpile group as defined on Wikipedia isn't in play here. On a finite graph with sinks, a group structure arises
connect your phone to Mac using the USB cable. Open Finder. There's a list of drives, right? "Look for Android File Transfer", and double click the icon.
@EricTressler i was thinking it might be possible to have a non-empty configuration of sandpiles on the grid graph so that if you topple the sandpiles, the sand gets pushed off to infinity with all cells stabiliziing to zero in in the limit, much like ...111111 + 1 = 0 with 2's complement, but on thinking more it seems clearly impossible
@xnor It'd probably useful to see whether it's possible to configure sandpiles on an infinite grid, with at least one pile within the center-most 9 spots, such that once you topple them, the center-most 9 spots are clear.
Actually, I'm not sure it's even possible to clear a 2x2 square if there was at least one pile inside it.
I am still searching...
I am looking by using this Python code:
Furthermore as noted by @elias
Reduced bounds from before I started a search...
Because
A lower value for the upper bound is:
Lowered further by @astralfenix to
This can be lowered a touch to
