A199357 Smallest positive integer with n anagrams.

1, 12, 112, 102, 11112, 123, 1111112, 10002, 1012, 11122, 11111111112, 1123, 1111111111112, 10000002, 111122, 10112, 11111111111111112, 1023, 1111111111111111112, 11123, 1111122, 100000000002, 11111111111111111111112

Offset

1,2

Comments

An anagram is a number having the same digits. Leading zeros are not allowed.

Links

David W. Wilson, Table of n, a(n) for n = 1..1000

Formula

For odd n, a(n) <= (10^n+8)/9, with equality for infinitely many n, including all prime n and other odd values starting at n = 27.

For even n, a(n) <= 10^(n/2)+2, with equality for infinitely many n, including all n = 2*p.

Example

a(4) = 102 is the smallest number with 4 anagrams, namely 102, 120, 201, 210. 012 and 021 do not count as they start with 0.

Crossrefs

Sequence in context: A199691 A348150 A077754 * A293872 A044344 A130838

Adjacent sequences: A199354 A199355 A199356 * A199358 A199359 A199360

Keyword

nonn,base

Author

David W. Wilson, Nov 05 2011

Status

approved