2017-03-31 02:55:13 +0100 | received badge | ● Famous Question (source) |

2015-01-14 10:22:36 +0100 | received badge | ● Notable Question (source) |

2013-05-17 09:04:21 +0100 | received badge | ● Popular Question (source) |

2011-09-19 11:53:59 +0100 | received badge | ● Student (source) |

2011-09-19 01:15:08 +0100 | commented answer | Can I create these sequences with Sage? That seems to have done the trick; thanks so much, Benjamin! |

2011-09-18 19:57:45 +0100 | commented answer | Can I create these sequences with Sage? Thanks so much for the info, Benjamin. I have Sage installed and was able to generate the lists. Looking at the result, starting with [6, 1, 1, 1, 1, 1, 1], I think I should have been clearer in my description. I want to limit the numbers used to 1, 2, and 3 (i.e., no 4, 5, 6, etc.), THEN create all possible orderings of those numbers. The results I generated include 4, 5, and 6, and are not limited to 1, 2, and 3. I did a little background work on this, and it looks as though there are basically three series that will fulfill my criteria: [1+1+1+1+2+3+3], [1+1+1+2+2+2+3], and [1+1+2+2+2+2+2] (there could be another I've missed, perhaps?). Having those basic series (I apologize if my terminology is confusing ... (more) |

2011-09-18 17:53:09 +0100 | asked a question | Can I create these sequences with Sage? Let me start by confessing that I know next to nothing about math and really don't know exactly how to describe what I'm trying here; I hope the below description is adequate. I am attempting to create a list of all possible 7-digit sequences of the numbers 1, 2, and 3 that add up to 12 (e.g., 1-2-2-3-1-1-2, 2-1-2-3-1-1-2, 2-1-2-3-1-2-1, etc.). I'm not looking merely for the number of sequences, but the actual sequences themselves. Is this something that Sage is capable of and, if so, how would I go about accomplishing this? If notÂ… any suggestions? Thank you in advance. Greg |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.