This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113698 Combinatorial sequence. Begin with 1 then 2 then 12 then 3 then all concatenations of all sizes of 1,2 and 3, then 4, then all concatenations of all sizes of 1,2,3,4 not included earlier etc. 2
 1, 2, 12, 3, 13, 23, 123, 4, 14, 24, 34, 124, 134, 234, 1234, 5, 15, 25, 35, 45, 125, 135, 145, 235, 245, 345, 1235, 1245, 1345, 2345, 12345, 6, 16, 26, 36, 46, 56, 126, 136, 146, 156, 236, 246, 256, 346, 356, 456, 1236, 1246, 1256, 1346, 1356, 1456, 2346, 2356 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The index of n is 2^n for n<10. After 9 if n ( like 13, 23) has appeared earlier it will not appear but it will be used in the concatenation at its turn as mentioned above. needs better description. The sequence contains groups of integers generated from seeds s=1,2,3,4,... A group is the sorted list of numbers defined by the seed and all concatenations of integers of previous groups with the seed, discarding any duplicates. - R. J. Mathar, Aug 31 2007 LINKS T. D. Noe, Table of n, a(n) for n = 1..511 EXAMPLE The group 4, 14, 24, 34, 124, 134, 234, 1234 is generated from the seed s=4 itself and attaching s=4 to the previous elements 1, 2, 12, 3, 13, 23, 123, that is 14, 24, 124, 34, 134, 234, 1234, then sorting within the group (moving 34 between 24 and 124). MATHEMATICA Flatten[Table[FromDigits /@ Complement[Subsets[Range[n]], Subsets[Range[n - 1]]], {n, 5}]] (* T. D. Noe, Feb 22 2012 *) CROSSREFS Cf. A113699. Sequence in context: A012629 A082827 A072484 * A048794 A164869 A082292 Adjacent sequences:  A113695 A113696 A113697 * A113699 A113700 A113701 KEYWORD base,nonn AUTHOR Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 11 2005 EXTENSIONS More terms from R. J. Mathar, Aug 31 2007 STATUS approved

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

Content is available under The OEIS End-User License Agreement .