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.
%I A085585 #26 Jul 27 2025 11:16:28
%S A085585 1,9,16,25,36,49,81,100,144,225,256,289,324,441,625,676,784,841,900,
%T A085585 1024,1444,1600,2025,2209,2304,2401,2500,2601,2704,2809,3600,3844,
%U A085585 4096,4225,4489,4900,6241,6724,6889,8100,8281,8649,8836,9604,10000,10404
%N A085585 Squares with exactly one odd digit.
%C A085585 If k is a term, then so is 100*k. - _Robert Israel_, Sep 29 2023
%H A085585 Robert Israel, <a href="/A085585/b085585.txt">Table of n, a(n) for n = 1..10000</a>
%e A085585 20164 is a term because 20164 = 142^2 and 20164 has exactly one odd digit.
%p A085585 filter:= proc(n) nops(select(type,convert(n,base,10),even))=1 end proc:
%p A085585 select(filter, [seq(i^2, i=1..10000)]); # _Robert Israel_, Sep 29 2023
%t A085585 bb={}; Do[idp=IntegerDigits[n^2]; len=Length[idp]; If[Sum[Mod[idp[[i]], 2], {i, len}]==1, bb={bb, n}], {n, 200}]; Flatten[bb]^2
%t A085585 Select[Range[150]^2,Count[IntegerDigits[#],_?OddQ]==1&] (* _Harvey P. Dale_, Jul 27 2025 *)
%Y A085585 Cf. A000290, A068690.
%K A085585 nonn,base
%O A085585 1,2
%A A085585 _Zak Seidov_, Jul 06 2003
%E A085585 Name and example edited by _Jon E. Schoenfield_, Sep 29 2023