The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054037 Numbers n such that n^2 contains exactly 9 different digits. 14

%I

%S 10124,10128,10136,10214,10278,11826,12363,12543,12582,12586,13147,

%T 13268,13278,13343,13434,13545,13698,14098,14442,14676,14743,14766,

%U 15353,15681,15963,16549,16854,17252,17529,17778,17816,18072,19023

%N Numbers n such that n^2 contains exactly 9 different digits.

%C There are three prime numbers {13147, 20089, 21397} and corresponding squares {172843609, 403567921, 457831609} necessarily contain zero (otherwise n and n^2 are divisible by 3). - _Zak Seidov_, Jan 18 2012

%H Zak Seidov, <a href="/A054037/b054037.txt">Table of n, a(n) for n = 1..83</a> (complete sequence)

%p f := []; for i from 0 to 200 do if nops({op(convert(i^2,base,10))})=9 then f := [op(f),i] fi; od; f;

%t okQ[n_] := Module[{n2=n^2}, Max[DigitCount[n2,10]]==1 && IntegerLength[n2]==9]; Select[Range[20000], okQ] (* _Harvey P. Dale_, Mar 20 2011 *)

%Y Cf. A016069, A054031, A054032, A054033, A054034, A054035, A054036, A054038, A054039, A156977.

%K nonn,base,fini,full

%O 1,1

%A Asher Auel (asher.auel(AT)reed.edu), Feb 28 2000

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

Last modified May 26 02:56 EDT 2020. Contains 334613 sequences. (Running on oeis4.)