|
| |
|
|
A075854
|
|
Smallest integer comprised 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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The sequence is only defined to n=9. Only 11 is prime.
|
|
|
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: A066945 A113615 A034873 * A050786 A088103 A180561
Adjacent sequences: A075851 A075852 A075853 * A075855 A075856 A075857
|
|
|
KEYWORD
| nonn,base,fini,full
|
|
|
AUTHOR
| Jon Perry (perry(AT)globalnet.co.uk), Oct 15 2002
|
| |
|
|
