OFFSET
1,2
COMMENTS
The subsequence A198298 corresponding to n=9 was suggested by E. Angelini (cf. link).
If we consider permutations of [1,...,n], the only solutions are { 1, 12, 21, 213, 312, 3412, 4312, 71532486 }.
There are 285 terms.
LINKS
Jason Kimberley, Table of n, a(n) for n = 1..285 (complete sequence)
Eric Angelini, 10 different digits, 9 products
E. Angelini, 10 different digits, 9 products [Cached copy, with permission]
E. Angelini, 10 different digits, 9 products, Posting to Seqfan List, Jan 03 2012
EXAMPLE
The term 12034 is in the sequence since 1*2=2, 2*0=0, 0*3=0 and 3*4=12 are all substrings of 12034. This is the least nontrivial term in the sense that it contains two adjacent digits > 1, which is the case for all solutions > 42000.
PROG
(PARI) n_digit_terms(n)={ my(a=[], p=vector(n, i, 10^(n-i))~, t); for(i=(n-1)!, n!-1, is_A203565(t=numtoperm(n, i)%n*p) & a=concat(a, t)); vecsort(a)}
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
M. F. Hasler, Jan 03 2012
STATUS
approved