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.

A054033 Numbers n such that n^2 contains exactly 5 different digits.

This page as a plain text file.
%I A054033 #22 Oct 27 2023 22:00:46
%S A054033 113,116,117,118,124,126,128,133,134,136,137,142,144,147,148,152,153,
%T A054033 154,169,172,174,175,176,178,179,181,186,189,191,193,195,196,198,199,
%U A054033 203,209,213,214,217,219,224,226,228,232,233,248,252,259,267,268,269
%N A054033 Numbers n such that n^2 contains exactly 5 different digits.
%C A054033 The first 66 terms are the only ones whose squares contain no repeated digits. - _Charles R Greathouse IV_, Feb 09 2015
%H A054033 Harvey P. Dale, <a href="/A054033/b054033.txt">Table of n, a(n) for n = 1..1000</a>
%p A054033 f := []; for i from 0 to 200 do if nops({op(convert(i^2,base,10))})=5 then f := [op(f),i] fi; od; f;
%t A054033 Select[Range[101,500],Count[DigitCount[#^2],0]==5&] (* _Harvey P. Dale_, Feb 08 2015 *)
%o A054033 (PARI) is(n)=#Set(digits(n^2))==5 \\ _Charles R Greathouse IV_, Feb 08 2015
%Y A054033 Cf. A016069, A054031, A054032, A054034, A054035, A054036, A054037, A054038, A054039.
%K A054033 nonn,base
%O A054033 1,1
%A A054033 _Asher Auel_, Feb 29 2000