cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A225218 #34 Dec 27 2022 10:51:43
%S A225218 1026753849,1042385796,1098524736,1237069584,1248703569,1278563049,
%T A225218 1285437609,1382054976,1436789025,1503267984,1532487609,1547320896,
%U A225218 1643897025,1827049536,1927385604,1937408256,2076351489,2081549376,2170348569,2386517904,2431870596
%N A225218 Square numbers containing all the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.
%C A225218 The first term having a repeated digit is 10057482369. - _Colin Barker_, Jan 15 2014
%H A225218 Reiner Moewald, <a href="/A225218/b225218.txt">Table of n, a(n) for n = 1..4865</a>
%F A225218 a(n) = A054038(n)^2. - _Colin Barker_, Jan 15 2014
%e A225218 1026753849 is in the sequence because 1026753849 = 32043^2 and 1026753849 contains all ten digits 0, ..., 9.
%t A225218 Select[#^2 &[Range[1000000]], Length[Union[IntegerDigits[#]]] == 10 &] (* _Geoffrey Critzer_, Jan 04 2015 *)
%o A225218 (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 A225218 (Python)
%o A225218 from itertools import count, islice
%o A225218 def c(n): return len(set(str(n))) == 10
%o A225218 def agen(): yield from (k*k for k in count(31622) if c(k*k))
%o A225218 print(list(islice(agen(), 21))) # _Michael S. Branicky_, Dec 27 2022
%Y A225218 Supersequence of A036745.
%Y A225218 Cf. A235717-A235724.
%K A225218 nonn,base
%O A225218 1,1
%A A225218 _Reiner Moewald_, May 02 2013