The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A075854 Smallest integer composed of digits 1..n such that no subsequence is repeated and every possible subsequence of length 2 appears. 0
 11, 11221, 1121322331, 11213142232433441, 11213141522324253343544551, 1121314151622324252633435364454655661, 11213141516172232425262733435363744546475565766771, 11213141516171822324252627283343536373844546474855657586676877881, 1121314151617181922324252627282933435363738394454647484955657585966768697787988991 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The sequence is only defined to n=9. Only 11 is prime. LINKS FORMULA There is a fairly obvious pattern to these numbers. EXAMPLE a[2]=11221, as 11 gives the lowest opening, 22 must come next, then 1. CROSSREFS Sequence in context: A267940 A113615 A034873 * A050786 A228566 A228533 Adjacent sequences:  A075851 A075852 A075853 * A075855 A075856 A075857 KEYWORD nonn,base,fini,full AUTHOR Jon Perry, Oct 15 2002 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 16:58 EST 2020. Contains 331280 sequences. (Running on oeis4.)