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.

A076164 Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.

This page as a plain text file.
%I A076164 #21 May 19 2018 19:22:14
%S A076164 0,11112,11121,11211,11356,11365,11536,11563,11635,11653,12111,13156,
%T A076164 13165,13516,13561,13615,13651,15136,15163,15316,15361,15613,15631,
%U A076164 16135,16153,16315,16351,16513,16531,21111,31156,31165,31516,31561
%N A076164 Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.
%C A076164 The minimal number of digits in any nonzero term is 5.
%C A076164 Numbers such that the sum of even digits equals the sum of odd digits are listed in A036301.
%e A076164 11356 is in the sequence because 1^2 + 1^2 + 3^2 + 5^2 = 6^2.
%t A076164 oeQ[n_]:=Module[{idn=IntegerDigits[n]},Total[Select[idn,OddQ]^2]== Total[ Select[ idn, EvenQ]^2]]; Select[Range[0,99999],oeQ] (* _Harvey P. Dale_, Sep 23 2011 *)
%o A076164 (PARI) is(n)=!vecsum(apply(d->d^2*(-1)^d,digits(n))) \\ _M. F. Hasler_, May 18 2018
%Y A076164 Cf. A303269, A036301 (analog without squares), A071650, A304439, A304440, A124176, A124177.
%K A076164 nonn,base
%O A076164 1,2
%A A076164 _Zak Seidov_, Nov 01 2002
%E A076164 Edited and a(1) = 0 added by _M. F. Hasler_, May 18 2018