login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199357 Smallest positive integer with n anagrams. 1

%I #9 Dec 14 2014 06:18:19

%S 1,12,112,102,11112,123,1111112,10002,1012,11122,11111111112,1123,

%T 1111111111112,10000002,111122,10112,11111111111111112,1023,

%U 1111111111111111112,11123,1111122,100000000002,11111111111111111111112

%N Smallest positive integer with n anagrams.

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

%H David W. Wilson, <a href="/A199357/b199357.txt">Table of n, a(n) for n = 1..1000</a>

%F 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.

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

%e 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.

%K nonn,base

%O 1,2

%A _David W. Wilson_, Nov 05 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)