This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079840 Largest multiple of n as a concatenation of its partitions. 0
 1, 2, 111, 112, 5, 11112, 21112, 1111112, 111111111, 10, 110, 11111111112, 21112111111, 112111111112, 11111111115, 11111111112112, 211111111121111, 11111111111111112, 21111111211111111, 20, 21111111111111111111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Any ordering of terms of the partition can be used before concatenation. [From D. S. McNeil, May 09 2010] LINKS EXAMPLE a(4) = 112: the partitions of 4 are 4,(3,1),(2,2),(1,1,2),(1,1,1,1). There are two multiples of 4 i.e. 4 and 112. a(6) = 11112,(all partitions with one even part give multiples of 6 and 11112 is the largest). CROSSREFS Sequence in context: A093425 A091508 A075399 * A231278 A117698 A274057 Adjacent sequences:  A079837 A079838 A079839 * A079841 A079842 A079843 KEYWORD nonn,base AUTHOR Amarnath Murthy, Feb 16 2003 EXTENSIONS Edited by D. S. McNeil, May 09 2010 At suggestion of Charles R Greathouse IV, corrected and extended by D. S. McNeil, May 09 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.