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!)
A225218 Square numbers containing all the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9. 14

%I #34 Dec 27 2022 10:51:43

%S 1026753849,1042385796,1098524736,1237069584,1248703569,1278563049,

%T 1285437609,1382054976,1436789025,1503267984,1532487609,1547320896,

%U 1643897025,1827049536,1927385604,1937408256,2076351489,2081549376,2170348569,2386517904,2431870596

%N Square numbers containing all the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.

%C The first term having a repeated digit is 10057482369. - _Colin Barker_, Jan 15 2014

%H Reiner Moewald, <a href="/A225218/b225218.txt">Table of n, a(n) for n = 1..4865</a>

%F a(n) = A054038(n)^2. - _Colin Barker_, Jan 15 2014

%e 1026753849 is in the sequence because 1026753849 = 32043^2 and 1026753849 contains all ten digits 0, ..., 9.

%t Select[#^2 &[Range[1000000]], Length[Union[IntegerDigits[#]]] == 10 &] (* _Geoffrey Critzer_, Jan 04 2015 *)

%o (PARI) s=[]; for(n=1, 100000, if(#vecsort(eval(Vec(Str(n^2))), , 8)==10, s=concat(s, n^2))); s \\ _Colin Barker_, Jan 15 2014

%o (Python)

%o from itertools import count, islice

%o def c(n): return len(set(str(n))) == 10

%o def agen(): yield from (k*k for k in count(31622) if c(k*k))

%o print(list(islice(agen(), 21))) # _Michael S. Branicky_, Dec 27 2022

%Y Supersequence of A036745.

%Y Cf. A235717-A235724.

%K nonn,base

%O 1,1

%A _Reiner Moewald_, May 02 2013

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 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)