{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-06T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":52956,"title":"Compute the largest number whose prime factors sum to n","description":"This problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 would also fit, but the elements of this sequence are the largest possible examples. \r\nWrite a function to produce the th term in this sequence. In other words, compute the largest number whose prime factors sum to . Take the first term in the sequence to be 1. ","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 93px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 46.5px; transform-origin: 407px 46.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 368.325px 8.05px; transform-origin: 368.325px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 would also fit, but the elements of this sequence are the largest possible examples. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 97.1083px 8.05px; transform-origin: 97.1083px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eWrite a function to produce the \u003c/span\u003e\u003c/span\u003e\u003cspan style=\"font-family: \u0026quot;STIXGeneral\u0026quot;, \u0026quot;STIXGeneral-webfont\u0026quot;, serif; font-style: italic; font-weight: 400; color: rgb(0, 0, 0);\"\u003en\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 280.042px 8.05px; transform-origin: 280.042px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eth term in this sequence. In other words, compute the largest number whose prime factors sum to \u003c/span\u003e\u003c/span\u003e\u003cspan style=\"font-family: \u0026quot;STIXGeneral\u0026quot;, \u0026quot;STIXGeneral-webfont\u0026quot;, serif; font-style: italic; font-weight: 400; color: rgb(0, 0, 0);\"\u003en\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 138.058px 8.05px; transform-origin: 138.058px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e. Take the first term in the sequence to be 1. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = sopfEqualsN(n)\r\n  y = sum(factor(n));\r\nend","test_suite":"%%\r\nn = 1;\r\ny = sopfEqualsN(n);\r\ny_correct = 1;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 5;\r\ny = sopfEqualsN(n);\r\ny_correct = 6;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 10;\r\ny = sopfEqualsN(n);\r\ny_correct = 36;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 11;\r\ny = sopfEqualsN(n);\r\ny_correct = 54;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 13;\r\ny = sopfEqualsN(n);\r\ny_correct = 108;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 17;\r\ny = sopfEqualsN(n);\r\ny_correct = 486;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 19;\r\ny = sopfEqualsN(n);\r\ny_correct = 972;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 23;\r\ny = sopfEqualsN(n);\r\ny_correct = 4374;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 29;\r\ny = sopfEqualsN(n);\r\ny_correct = 39366;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 31;\r\ny = sopfEqualsN(n);\r\ny_correct = 78732;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 37;\r\ny = sopfEqualsN(n);\r\ny_correct = 708588;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 41;\r\ny = sopfEqualsN(n);\r\ny_correct = 3188646;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 47;\r\ny = sopfEqualsN(n);\r\ny_correct = 28697814;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 53;\r\ny = sopfEqualsN(n);\r\ny_correct = 258280326;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 59;\r\ny = sopfEqualsN(n);\r\ny_correct = 2324522934;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 61;\r\ny = sopfEqualsN(n);\r\ny_correct = 4649045868;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 67;\r\ny = sopfEqualsN(n);\r\ny_correct = 41841412812;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 71;\r\ny = sopfEqualsN(n);\r\ny_correct = 188286357654;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 73;\r\ny = sopfEqualsN(n);\r\ny_correct = 376572715308;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 79;\r\ny = sopfEqualsN(n);\r\ny_correct = 3389154437772;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 83;\r\ny = sopfEqualsN(n);\r\ny_correct = 15251194969974;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 89;\r\ny = sopfEqualsN(n);\r\ny_correct = 137260754729766;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 91;\r\ny = sopfEqualsN(n);\r\ny_correct = 274521509459532;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 97;\r\ny = sopfEqualsN(n);\r\ny_correct = 2470693585135788;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 100;\r\ny = sopfEqualsN(n);\r\ny_correct = 7412080755407364;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nfiletext = fileread('sopfEqualsN.m');\r\nillegal = contains(filetext, 'assignin') || contains(filetext, 'regexp') || contains(filetext, 'oeis') || contains(filetext, 'persistent'); \r\nassert(~illegal)","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":46909,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":15,"test_suite_updated_at":"2021-10-14T11:50:30.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2021-10-14T11:40:34.000Z","updated_at":"2025-12-14T17:54:28.000Z","published_at":"2021-10-14T11:47:09.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 would also fit, but the elements of this sequence are the largest possible examples. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a function to produce the \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003eth term in this sequence. In other words, compute the largest number whose prime factors sum to \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003e. Take the first term in the sequence to be 1. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":52956,"title":"Compute the largest number whose prime factors sum to n","description":"This problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 would also fit, but the elements of this sequence are the largest possible examples. \r\nWrite a function to produce the th term in this sequence. In other words, compute the largest number whose prime factors sum to . Take the first term in the sequence to be 1. ","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 93px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 46.5px; transform-origin: 407px 46.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 368.325px 8.05px; transform-origin: 368.325px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 would also fit, but the elements of this sequence are the largest possible examples. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 97.1083px 8.05px; transform-origin: 97.1083px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eWrite a function to produce the \u003c/span\u003e\u003c/span\u003e\u003cspan style=\"font-family: \u0026quot;STIXGeneral\u0026quot;, \u0026quot;STIXGeneral-webfont\u0026quot;, serif; font-style: italic; font-weight: 400; color: rgb(0, 0, 0);\"\u003en\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 280.042px 8.05px; transform-origin: 280.042px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eth term in this sequence. In other words, compute the largest number whose prime factors sum to \u003c/span\u003e\u003c/span\u003e\u003cspan style=\"font-family: \u0026quot;STIXGeneral\u0026quot;, \u0026quot;STIXGeneral-webfont\u0026quot;, serif; font-style: italic; font-weight: 400; color: rgb(0, 0, 0);\"\u003en\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 138.058px 8.05px; transform-origin: 138.058px 8.05px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e. Take the first term in the sequence to be 1. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = sopfEqualsN(n)\r\n  y = sum(factor(n));\r\nend","test_suite":"%%\r\nn = 1;\r\ny = sopfEqualsN(n);\r\ny_correct = 1;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 5;\r\ny = sopfEqualsN(n);\r\ny_correct = 6;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 10;\r\ny = sopfEqualsN(n);\r\ny_correct = 36;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 11;\r\ny = sopfEqualsN(n);\r\ny_correct = 54;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 13;\r\ny = sopfEqualsN(n);\r\ny_correct = 108;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 17;\r\ny = sopfEqualsN(n);\r\ny_correct = 486;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 19;\r\ny = sopfEqualsN(n);\r\ny_correct = 972;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 23;\r\ny = sopfEqualsN(n);\r\ny_correct = 4374;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 29;\r\ny = sopfEqualsN(n);\r\ny_correct = 39366;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 31;\r\ny = sopfEqualsN(n);\r\ny_correct = 78732;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 37;\r\ny = sopfEqualsN(n);\r\ny_correct = 708588;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 41;\r\ny = sopfEqualsN(n);\r\ny_correct = 3188646;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 47;\r\ny = sopfEqualsN(n);\r\ny_correct = 28697814;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 53;\r\ny = sopfEqualsN(n);\r\ny_correct = 258280326;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 59;\r\ny = sopfEqualsN(n);\r\ny_correct = 2324522934;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 61;\r\ny = sopfEqualsN(n);\r\ny_correct = 4649045868;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 67;\r\ny = sopfEqualsN(n);\r\ny_correct = 41841412812;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 71;\r\ny = sopfEqualsN(n);\r\ny_correct = 188286357654;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 73;\r\ny = sopfEqualsN(n);\r\ny_correct = 376572715308;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 79;\r\ny = sopfEqualsN(n);\r\ny_correct = 3389154437772;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 83;\r\ny = sopfEqualsN(n);\r\ny_correct = 15251194969974;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 89;\r\ny = sopfEqualsN(n);\r\ny_correct = 137260754729766;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 91;\r\ny = sopfEqualsN(n);\r\ny_correct = 274521509459532;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 97;\r\ny = sopfEqualsN(n);\r\ny_correct = 2470693585135788;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 100;\r\ny = sopfEqualsN(n);\r\ny_correct = 7412080755407364;\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nfiletext = fileread('sopfEqualsN.m');\r\nillegal = contains(filetext, 'assignin') || contains(filetext, 'regexp') || contains(filetext, 'oeis') || contains(filetext, 'persistent'); \r\nassert(~illegal)","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":46909,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":15,"test_suite_updated_at":"2021-10-14T11:50:30.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2021-10-14T11:40:34.000Z","updated_at":"2025-12-14T17:54:28.000Z","published_at":"2021-10-14T11:47:09.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 would also fit, but the elements of this sequence are the largest possible examples. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a function to produce the \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003eth term in this sequence. In other words, compute the largest number whose prime factors sum to \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003e. Take the first term in the sequence to be 1. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"term":"tag:\"integer complexity\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"integer complexity\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"integer complexity\"","","\"","integer complexity","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f6c8641a830\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f6c8641a790\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f6c86419ed0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f6c8641aab0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f6c8641aa10\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f6c8641a970\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f6c8641a8d0\u003e":"tag:\"integer complexity\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f6c8641a8d0\u003e":"tag:\"integer complexity\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"integer complexity\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"integer complexity\"","","\"","integer complexity","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f6c8641a830\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f6c8641a790\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f6c86419ed0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f6c8641aab0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f6c8641aa10\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f6c8641a970\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f6c8641a8d0\u003e":"tag:\"integer complexity\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f6c8641a8d0\u003e":"tag:\"integer complexity\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":52956,"difficulty_rating":"easy-medium"}]}}