|
Search: id:A075854
|
|
|
| A075854 |
|
Smallest integer comprised of digits 1..n such that no subsequence is repeated and every possible subsequence of length 2 appears. |
|
+0
1
|
|
| 11, 11221, 1121322331, 11213142232433441, 11213141522324253343544551, 1121314151622324252633435364454655661, 11213141516172232425262733435363744546475565766771, 11213141516171822324252627283343536373844546474855657586676877881, 11213141516171819223242526272829334353637383944546474849556575859667686977879889\ 91
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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 this_sequence A050786 A088103 A125545
Adjacent sequences: A075851 A075852 A075853 this_sequence A075855 A075856 A075857
|
|
KEYWORD
|
nonn,base,fini,full
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Oct 15 2002
|
|
|
Search completed in 0.002 seconds
|
