login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest square containing all the digits of numbers from 1 to n. For a(10) and higher, all duplicated digits must be in the term (for example a(10) has two 1's).
2

%I #9 May 18 2020 22:40:02

%S 1,121,3721,13924,135424,1236544,13527684,13527684,139854276,

%T 11738205649,10112819764356,1011123678945241,10118426359171321,

%U 10111134329645378121,1011111632116847554329,10111124953183456116721,1011111119736855441726321,101111112641746351915327881,10111111111271587168434259369

%N Smallest square containing all the digits of numbers from 1 to n. For a(10) and higher, all duplicated digits must be in the term (for example a(10) has two 1's).

%e a(5) = 335241 = 579^2 contains digits 1,2,3,4 and 5.

%Y Cf. A088628.

%K nonn,base,more

%O 1,2

%A _Amarnath Murthy_, Mar 25 2002

%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jan 20 2003

%E a(14)-a(15) from _Giovanni Resta_, Aug 06 2019

%E a(16)-a(19) from _Chai Wah Wu_, May 18 2020