id:A078188 - OEIS Search Results

Search: id:A078188

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n > 1 take the digits of a(n-1) one after the other and remove one occurrence of this digit from the digits of m = k*n (k > 0) if possible; a(n) is the smallest multiple m of n which has the least number of remaining digits (counted with multiplicity).

+0
1

1, 2, 3, 4, 5, 6, 7, 8, 9, 90, 99, 96, 26, 28, 285, 528, 85, 18, 19, 20, 21, 22, 23, 24, 25, 52, 27, 28, 29, 90, 93, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71 (list; graph; listen)

page 1

Search completed in 0.001 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research