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.

A343728 Numbers with all digits even whose squares have all but one digit odd.

This page as a plain text file.
%I A343728 #17 May 22 2021 04:26:08
%S A343728 0,2,4,6,24,44,86,244,424,444,846,2444,4424,6286,42424,44244,240244,
%T A343728 244086,244866,268286,420846,442244,446286,628646,880646,2402444,
%U A343728 4402044,4442244,8448666,24040244,24064866,26682086,26682866,26828666,28244244,42400424
%N A343728 Numbers with all digits even whose squares have all but one digit odd.
%C A343728 Of course, the one even digit in the square is always the last digit.
%H A343728 Chai Wah Wu, <a href="/A343728/b343728.txt">Table of n, a(n) for n = 1..100</a>
%e A343728 244086 is a term: all its digits are even, and 244086^2 = 59577975396 has all but one digit odd.
%e A343728 244044086 is a term: all its digits are even, and 244044086^2 = 59557515911575396 has all but one digit odd.
%t A343728 Select[Range[0, 10^6], AllTrue[IntegerDigits[#], EvenQ] && AllTrue[Most @ IntegerDigits[#^2], OddQ] &] (* _Amiram Eldar_, May 20 2021 *)
%o A343728 (Python)
%o A343728 def ok(n):
%o A343728   r, s = str(n), str(n*n)
%o A343728   return all(d in "02468" for d in r) and all(d in "13579" for d in s[:-1])
%o A343728 print(list(filter(ok, range(0, 42400425, 2)))) # _Michael S. Branicky_, May 20 2021
%o A343728 (Python)
%o A343728 from gmpy2 import digits
%o A343728 A343728_list = [n for n in (2*int(digits(d,5)) for d in range(10**6)) if set(str(n**2)[:-1]) <= set('13579')] # _Chai Wah Wu_, May 21 2021
%Y A343728 Cf. A014263, A030098, A343727.
%K A343728 nonn,base
%O A343728 1,2
%A A343728 _Jon E. Schoenfield_, May 20 2021